CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

UNIT 1

2 MARKS WITH ANSWER

1. What do you mean by message passing?

• In this model, data is shared by sending and receiving messages between co-
operating processes, using system calls.

• It is a one-way transfer operation between two programs.

2. Define distributed program.

• Distributed program is composed of a set of "n" asynchronous processes like P1 P2 P3...Pi

,Pn
• It communicates by message passing over the communication network.

3. What do you mean by synchronous and asynchronous execution?

• Synchronous execution means the first task in a program must finish processing
before moving on to executing the next task.

• Asynchronous execution means a second task can begin executing in parallel,

without waiting for an earlier task to finish.

4. List out the features of distributed systems.

• Heterogeneity

• Openness

• scalability

• fault tolerance

• transparency and resource sharing.

5. Write down the principles of distributed systems.

• Distributed system consists of a collection of autonomous computers, connected through a

network and distribution middleware.

• It enables computers to coordinate their activities and to share the resources of the system,
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

so that users perceive the system as a single, integrated computing facility.

6. State the objectives of resource sharing model.

• Ability to use any hardware, software or data anywhere in the system.

• Resource manager controls access, provides naming scheme and controls

concurrency.

7. What are the significant consequences of distributed systems?

a. No global clock: The only communication is by sending messages through a network.

b. Independent failures: The programs may not be able to detect whether the network
has failed or has become unusually slow.
c. Concurrency: The capacity of the system to handle shared resources can increase by
adding more resources to the network.

8. Define transparency. What are its types?

A distributed system needs to hide the fact that its processes and resources are physically
distributed across multiple computers.

9. What is the need of openness in distributed system?

Distributed system must be able to interact with services from other open systems,
irrespective of the underlying environment.

10. List an example of distributed system.

• Internet,

• an intranet

• mobile and ubiquitous computing.

11. Enlist the design issues and challenges of distributed systems.

• heterogeneity openness,

• security,

• scalability,
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

• failure handling,

• concurrency and transparency.

12. Define access transparency.

Enables local and remote information objects to be accessed using identical operations.

13. What is replication transparency?

It enables multiple instances of information objects to be used to increase reliability and

performance.

Example: Distributed DBMS.

14. What is the goal of concurrency and failure transparency?

Enables several processes to operate concurrently using shared information objects

without interference between them.
Failure transparency: Allows users and applications to complete their tasks despite the
failure of other components.

15. Differentiate between buffering and caching.

• Cache is made from static ram which is faster than the slower dynamic ram used
for a buffer.

• A buffer temporarily stores data while the data is the process of moving from one
place to another, ie. the input device to the output device.

16. What is open distributed system?

Open distributed system is a system that offers services according to standard rules that
describe the syntax and semantics of those services.

[Link] what is meant by a scalable system?

A system is scalable with respect to either its number of components, size or number and
size of administrative domains,

[Link] is the role of middleware in a distributed system?

To enhance the distribution transparency that is missing in network operating systems.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

In other words, middleware aims at improving the single system view that a distributed
system should have.

16 MARKS:

1. Explain the difference between message passing and message sharing.

• Message passing
• Message sharing
• Emulating Message – passing systems on a shared memory system.

2. Describe about Design issues and challenges in Distributed Computing.

• Challenges from system perspective.

• Challenges.
o Heterogeneity
o Openness
o Security
o Scalability
o Failure handling
o Concurrency
o Transparency

3. Explain about the model of Distributed Computations: A distributed program

• A model of Distributed Execution

o Casual precedence relation
o Logical vs Physical concurrency
• Models of Communication Networks

4. What is Global State? Explain about the global state of Distributed Systems.

• Definition
• Requirements of global state
o Garbage collection
o Deadlock
o Termination
o Distributed debugging

5. Explain the applications of Distributed Computing and Challenges.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

• Applications
o Mobile systems
o Pervasive computing
▪ Intranet
o Multimedia system
▪ Web casting
UNIT 2

2 MARKS:

1. What is meant by asynchronous programming?

Asynchronous programming provides opportunities for a program to continue running other

code while waiting for a long-running task to complete.

2. What is meant by group communication in distributed system?

Group communication offers a service whereby a message is sent to a group and then this
message is delivered to all members of the group. The sender is not aware of the identities of the
receivers.

3. Write application of casual order.

• Implementing distributed shared memory

• fair resource allocation

• updating replicated data

• synchronizing multimedia streams

• allocating requests.

4. What is synchronous order?

When all the communication between pairs of processes is by using synchronous send and
receives primitives, the resulting order is synchronous order.

5. Define scalar time.

Scalar time is designed by Lamport to synchronize all the events in distributed systems.
Time domain is the set of non-negative integers.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

6. List the issue related with implementation of logical clocks.

• Addressing following issues: Data structures local to every process to represent logical
time.
• Protocol to update the data structures to ensure the consistency condition.

7. List the properties of scalar time.

• Consistency

• total ordering

• event counting

• system of scalar clocks is not strongly consistent.

8. What is Rendezvous?

Rendezvous is an architecture for creating multi-user applications.

It provides support for managing a multi-user session.

9. What is clock tick?

When the counter gets to zero, an interruption is generated and is called one clock tick.

10. What is clock skew?

With n computers, all n crystals will run at slightly different rates, causing the software
clocks to gradually get out of sync.

11. What is clock drift rate.

A clock drift rate is the change in the offset between the clock and a nominal perfect
reference clock per unit of time measured by the reference clock.

12. List the name of modes the NTP servers synchronize.

• multicast,

• procedure-call

• symmetric mode.

13. What are the two modes of synchronization?

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

The two modes are:

1. External synchronization: For a synchronization bound D > 0, and for a source S of

UTC time, IS(0)-C, (0) T. for i = 1,2 N and for all real times t in L

2 Internal synchronization: For a synchronization bound D>0.(C0)-C < D. for 1.1 1.2 N
and for all real times t in 1

14. What is logical clock?

• Logical clock is a monotonically increasing software counter.

• Each process P, keeps its own logical clock L., which it uses to apply so called
Lamport timestamps to events.

15. What is global state of the distributed system?

The global state of the distributed system consists of the local state of each process, together
with the messages which are in transit.

16. Write the happens-before relation?

The happens before relation can be observed directly in two situations:

1. If a and b are events in the same process, and a occurs before b then a 'b is true.

2. It is the event of a message being sent by one process, and b is the event of the message being
received by another process, then a b is also true.
17. What is need of physical clock?

• Lamport's algorithm for logical clock synchronization gives an unambiguous event

ordering the tone values assigned to events are not necessarily close to the actual
times at which they occur.

• In some systems like real-time systems, the actual clock time is important these
systems external physical clocks are required.

18. What is vector clock?

Vector clocks are used in a distributed system to determine whether pairs of events are
causally related.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

13 MARKS:

1. Explain Logical Time.

• Event Ordering
o Condition of happens before
o Logical clock condition
• Lamport Timestamp
• Vector Timestamp
2. Discuss about Physical Clock Synchronization: NTP

• Synchronization in a Synchronous System

• Cristian’s Method for Synchronizing Clocks
o Christian’s Algorithm
• Berkeley Algorithm
• Network Time Protocol
o Localized Averaging Distributed Algorithm.
▪ Network time protocol
▪ Features of NTP

3. Explain the difference between Scalar Time and Vector Time.

• Scalar Time
o Basic Properties
▪ Consistency property
▪ Total ordering
▪ Event counting
• Vector Time
o Definition

4. Describe and Explain the Group Communication.

• One to Many Communication

o Group Management
o Group addressing
o Buffered and unbuffered multicast
• Many to One Communication
• Many to Many Communication
o Message Ordering
▪ Absolute ordering
▪ Consistent/ Total Ordering
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

▪ Causal ordering

5. Explain the global state and snapshot recording algorithm.

• Definition
• System Model
• Consistent Global State
UNIT 3

2 MARKS:

1. Explain the term mutual exclusion.

Asynchronous programming provides opportunities for a program running other code

while waiting for a long-running task to complete.

2. What is deadlock?

• Deadlock is the problem of multiprogramming system.

• Deadlock can be defined as the permanent blocking of a set of processes that either
complete for system resources.

3. Name the two types of messages used in Ricart-Agrawala's algorithm.

Two type of messages used by Ricart-Agrawala are REQUEST and REPLY and
communication channels are assumed to follow FIFO order.

4. What are the conditions for deadlock?

Conditions should hold simultaneously for deadlock to occur are:

a) Mutual exclusion c) Hold and wait

b) No preemption d) Circular wait.

5. What is mutual exclusion?

Mutual exclusion in a distributed system states that only one process is allowed to execute
the critical section (CS) at any given time. In a distributed system, shared variables or a local kernel
cannot be used to implement mutual exclusion.

6. Which are the three basic approaches for implementing distributed mutual
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

exclusion?

• Token based approach

• Non-token based approach

• Quorum based approach

7. What are the requirements of mutual exclusion algorithms?

a. Freedom from deadlocks

b. Freedom from starvation

c Strict fairness

d. Fault tolerance

8. What are the performance metric of mutual exclusion algorithm?

• message complexity,

• synchronization delay,

• response time and system throughput.

9. What is response time?

The time interval a request waits for its CS execution to be over after its request messages
have been sent out.

10. What is a phantom deadlock?

A deadlock that is detected' but is not really a deadlock is called a phantom deadlock.

11. What is Resource allocation graph and wait for graph?

• The state of process-resource interaction in distributed systems can be modeled by

a bi- partite directed graph called a resource allocation graph.

• The nodes of this graph are processes and resources of a system, and the edges of
the graph depict assignments or pending requests.

• A pending request is represented by a request edge directed from the node of a

requesting process to the node of the requested resource.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

12. List the deadlock handling strategies in distributed system.

• deadlock prevention,

• deadlock avoidance,

• deadlock detection.

13. What do you mean by deadlock avoidance?

• The system must be able to decide whether granting a resource is safe or not and
only make the allocation when it is safe.

• When a process is created, it must declare its maximum claim, i.e. the maximum
number of unit resource .

• The resource manager can grant the request if the resources are available.

14. Define deadlock detection in distributed systems.

Deadlock detection requires examination of process-resource interaction for the presence

of cyclic wait.

15. What is Chandy-Misra-Haas Algorithm?

• A blocked process determines if it is deadlocked by initiating a diffusion

computation. processes in its dependent set.

• If an active process receives a query or reply message, it discards it. all the query
messages it has sent out.

16. What is OR Model?

Set of Deadlocked processes, where each process waits to receive messages from other
processes in the set.

17. What is AND Model?

Set of deadlocked processes, where each process waits for resource held by another
process.

Use AND condition.

The condition for deadlock in a system using the AND condition is the existence of a
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

cycle.

18. Define Deadlock Avoidance.

• Decision made dynamically, before allocating a resource, the resulting global

system state is checked, if it is safe state then allow for allocation.

• Because of the following drawback, deadlock avoidance can be impractical in

distributed system.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

16 MARKS:

1. What is Lampot’s Algorithm and Explain it?

• Definition
• Requesting the critical session
• Conditions for entering CS
• Releasing the CS
• Correctness
• Optimization
• Lamport evalution

2. Explain Ricart – Agarwala’s Algorithm.

• Definition
• Algorithm
• Requesting the Critical Session
• Executing the Critical Session
• Releasing the Critical Session

3. Explain Token Based Algorithm

• Definition
• Suzuki – Kasami’s Broadcast Algorithm.
o Major Design Issues
o Important Data Structures
o Algorithm
▪ Requesting CS
▪ Executing CS
▪ Releasing CS
▪ Theorem: A requesting site enters CS in finite time
▪ Performance

4. Discuss the Deadlock Detection in Distributed Systems: Introduction.

• Deadlock
• Necessary Condition
o Mutual exclusion
o Hold and wait
o Circular waiting
o No preemption
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

5. Explain Preliminaries: Deadlock Handling Strategies.

• Deadlock Prevention
o First Method
o Second Method
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

o Third Method
• Dead Avoidance
o Disadvantage
• Deadlock Detection
o Principle of operation
o Resolution
o Observation
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

UNIT 4

2 MARKS:

1. State the use of Rollback recovery.

Restore the system back to a consistent state after a failure

. • Achieve fault tolerance by periodically saving the state of a process during the
failure-free execution.

• Treats a distributed system application as communicate over a network.

2. What is consensus in distributed system?

Each process has an initial value and all the correct processes must agree on a single
value.

3. Write the purpose of using checkpoints.

• Check pointing is most typically used to provide fault tolerance to applications.

• Check pointing techniques are useful not only for availability, but also for program
debugging, process migration, and load balancing.

4. What do you mean by agreement problem in distributed system?

In the agreement problem, to achieve overall system reliability in the presence of a number
of faulty processes and single process has the initial value.

5. What is the difference between agreement and consensus problem?

The difference between the agreement problem and the consensus problem is that, in the
agreement problem, a single process has the initial value, whereas in the consensus problem, all
processes have an initial value.

6. Define recovery.

• Recovery refers to restoring a system to its normal operational state.

• Once a failure has occurred, it is essential that the process where the failure
happened recover to a correct state.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

7. Explain two types of checkpoints.

1. Tentative: A temporary checkpoint that is made a permanent checkpoint on the

successful termination of the checkpoint algorithm.

2. Permanent: A local checkpoint at a process.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

8. List drawback of synchronous check pointing.

1. Additional messages must be exchanged to coordinate check pointing

2. Synchronization delays are introduced during normal operations

3. No computational messages can be sent while the check pointing algorithm is in

progress.

4. If failure rarely occurs between successive checkpoints, then the checkpoint algorithm
places an unnecessary extra load on the system, which can significantly affect performance.

9. Define fault and failure. What are different approaches to fault-tolerance?

Fault: Anomalous physical condition, eg design errors, manufacturing problems, damage,

external disturbances.

Failure of a system occurs when the system does not perform its service in the manner
specified.

10. List the requirements of consensus algorithm to hold for

execution.

1. Termination
2. Agreement and
3. Integrity.

11. What are the performance aspects of agreement

protocols? Following metrics are used

1. Time: No of rounds needed to reach an agreement.

2. Message traffic: Number of messages exchanged to reach an agreement.

3. Storage overhead: Amount of information that needs to stored at processors

during execution of the protocol.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

12. What are the application of agreement algorithm?

Applications of agreement algorithms

• Fault-tolerant clock synchronization.

• Distributed systems require physical clocks to synchronized
• Physical clocks have drift problem.
• Agreement protocols may help to reach a common clock value. • Synchronizing
distributed clocks:
• At any time, values of clocks of all non-faulty processes must be approximately
equal.
• There is a small bound on amount by which the clock of a non-faulty process is

changed during re-synchronization.

13. State Byzantine agreement problem.

• In the Byzantine agreement problem, n processors communicate with each other in

order to reach an agreement on a binary value b.

• There are bad processors. that may collaborate with each other in order to prevent
an admissible agreement.

• Each processor has an initial binary value. The agreement must reflect to a certain
extent the majority among the initial value.

14. What is local checkpoints?

• A process may take a local check point anytime during the execution.

• The local checkpoints of different processes are not coordinated to form a global
consistent checkpoint.

15. What is forced checkpoints?

• To guard against the domino effect, a communication induced checkpoint protocol

piggybacks protocol-speci?c information to application messages that processes
exchange.

• Each process examines the information and occasionally is forced to take a

checkpoint according to the protocol.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

16. Explain useless checkpoints.

A useless checkpoint of a process is one that will never be part of a global consistent state.

17. What is checkpoint intervals?

A checkpoint interval is the sequence of events between two consecutive checkpoints in the
execution of a process.

18. Define orphan messages.

Messages with receive recorded but message send not recorded are called the orphan
messages.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

19. What is the basic idea behind task assignment approach?

Basic idea:

a. A process has already been split up into pieces called tasks:

b. The amount of computation required by each task and the are known.

c. The cost of processing each task on every node is known.

d. The IPC costs between every pair of tasks is known..

e. Precedence relationships among the taks are known.

f. Reassignment of tasks is not possible. Mention some motivations for replication.

16 MARKS:

1. Explain the Solution to Byzantine Agreement Problem.

• Impossible Scenario
• Lamport – Shostak – Pease Algorithm
o Example

2. Explain the Consistent Set of Checkpoint.

• Definition
o Strongly Consistent Set of Checkpoint.
o Consistent Set of Checkpoint
o Checkpoint Notation
• Synchronous Checkpoint and Recovery
o Checkpointing Algorithm
▪ Types
o Synchronous Checkpointing Disadvantages
• The Rollback Recovery Algorithm
o Phase one
o Phase two
• Message Types

3. Discuss about the Checkpoint – Based Recovery.

• Uncoordinated Checkpointing
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

o Direct dependency tracking technique

• Coordinated Checkpointing
o Blocking Checkpointing
o Non – Blocking Checkpointing
• Communication – induced Checkpointing
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

4. Describe the Issues in Failure Recovery.

• Basic Concept
• Recovery
o System Failure
o Erroneous System State
o Error
o Fault

5. Explain Byzantine Agreement Problem.

• Introduction
o The Problem
o Validity
• Consensus Problem
o Agreement
o Validity
• Interactive Consistency Problem
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

UNIT 5

2 MARKS:

1. Explain NIST definition of cloud computing.

NIST definition of cloud: Cloud computing is a pay-per-use model for enabling available,
convenient, on-demand network access to a shared pool of configurable computing resources (eg,
networks, servers, storage, applications, services).

2. What is cloud service?

Cloud service is any service made available to users on demand via the Internet from a
cloud computing provider's servers as opposed to being provided from a company's own on-
premises servers.

3. What is public cloud?

Public cloud is built over the Internet and can be accessed by any by user who has paid for
the service. Public clouds are owned by service providers and are accessible through a subscription.

4. What is private clouds?

A private cloud is built within the domain of an intranet owned by a single organization.
Therefore, it is client owned and managed, and its access is limited to the owning clients and their
partners.

5. Explain about virtual machines.

• A Virtual Machine (VM) is a software construct that mimics the characteristics. of

a physical server.

• VM is a software program or operating system that not only exhibits the behavior
of a separate computer

6. What is definition of laaS?

• The ability given to the infrastructure architects to deploy or run any software on the
computing resources provided by the service provider.

• The end users are responsible for managing applications that are running on top of the
service provider cloud infrastructure.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

7. Explain characteristics of laas.

Characteristics of laaS

1. Resources are provided as a service

2. Allows for dynamic scaling and elasticity.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

3. It has a variable cost, usage based pricing model (pay per go and pay per use)

4. It has multi-tenet architecture, includes multiple users on a single piece of

hardware.
5. IaaS typically has enterprise grade infrastructure.

8. List the situations where PaaS may not be the best option.

➢ Integration with on-premise applications.

➢ Flexibility at the platform level.
➢ Customization at the infrastructure level.
➢ Frequent application migration.

9. What is Amazon EC2?

Amazon Elastic Compute Cloud (Amazon EC2) is a web service that provides resizable
compute capacity in the cloud. It is designed to make web-scale computing easier for developers
and system administrators.

10. List the function of EC2?

EC2 functions:

1. Load variety of operating system.

2. Install custom applications

3. Manage network access permission 4. Run image using as many/few

systems as we desire.

11. What is Azure?

Windows Azure is a cloud computing platform and infrastructure, created by Microsoft, for
building, deploying and managing applications and services through a global network of
Microsoft-managed data centers.

12. What is Azure queues?

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

Azure queue storage is a service for storing large numbers of messages that can be accessed
from anywhere in the world via authenticated calls using HTTP or HTTPS A single queue message
can be up to 64 KB in size, and a queue can contain of messages, up to the total capacity limit of
a storage account.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

13. How virtualization employed in Azure?

Azure is a virtualized infrastructure to which a set of additional enterprise services has been
layered on top, including a virtualization service called An AppFabric that creates an application
hosting environment. AppFabric is a cloud-enabled version of the NET framework.

14. What is service cloud?

Service cloud refers to the service module in [Link]. It includes accounts, contacts,
cases, and solutions. It also encompasses features such as the publi knowledge base, web-to-case,
call center, and self-service portal, as well as custome service automation.

15. What is Google Cloud Storage?

Google cloud storage allows world-wide storage and retrieval of any amount of data at any
time. It can be used for a range of scenarios including serving website content, storing data for
archival and disaster recovery, or distributing large data objects to users via direct download.

16. Define Storage Service.

Amazon S3 defines a bucket name as a series of one or more labels, separated by periods,
that adhere to the following rules: The bucket name can be between 3 and 63 characters long, and
can contain only lower-case characters, numbers, periods, and dashes.

17. What Scalability and Elasticity?

Scalability is the ability of a system or network to handle increased load or usage. At the
same time, elasticity is the ability to automatically expand and contract resources to meet demand.

Cloud elasticity is a system's ability to manage available resources according to the current
workload requirements dynamically. This is a vital feature of a system infrastructure. It comes in
handy when the system is expected to experience sudden spikes of user activity and, as a result, a
drastic increase in workload demand.

18. Define Load Balancing.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

Load balancing can be defined as the process of task distribution among multiple
computers, processes, disk, or other resources in order to get optimal resource utilization and to
reduce the computation time.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

Load balancing is an important means to achieve effective resource sharing and utilization.

19. Define Pros and Cons of Virtualization.

Pros:

1. Data center and energy-efficiency savings: As companies reduce the size of their hardware
and server footprint, they lower their energy consumption.

2. Operational expenditure savings: Once servers are virtualized, your IT staff can greatly reduce
the ongoing administration and management of manual work.

3. Reduced costs: It reduced cost of IT infrastructure. 4. Data does not leak across virtual
machine.

5. Virtual machine is completely isolated from host machine and other virtual machine.

6. Simplifies resource management by pooling and sharing resources.

7. Significantly reduce downtime.

8. Improved performance of IT resources.

Cons:

1. Not all hardware or software can be virtualized.

2. Not all servers are applications are specifically designed to be virtualization-friendly.

20. Define Para-Virtualization.

Paravirtualization is a type of virtualization in which a guest operating system (OS) is

recompiled, installed inside a virtual machine (VM), and operated on top of a hypervisor program
running on the host OS.

• Para-virtualization refers to communication between the guest OS and the

hypervisor to improve performance and efficiency.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

• Para-virtualization involves modifying the OS kernel to replace non-

virtualizable instructions with hyper-calls that communicate directly with the virtualization layer
hypervisor.
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

13 MARKS:

1. Explain Cloud Deployment Models

• Public Cloud
o Benefits
o Risks
• Private Cloud
o Benefits
o Risks
• Community Cloud
• Hybrid Cloud
o Benefits
o Risks
• Difference between public and private Cloud

2. Explain Cloud Service Models

• Software as a Service(SaaS)
o Characteristics
o Benefits
• Platform as a Service(PaaS)
o Characteristics
o Benefits
• Infrastructure as a Service(IaaS)
o Types
▪ Physical Server
▪ Dedicated Virtual Server
▪ Shared Virtual Server
o Advantage

3. Discuss about Virtualization.

CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

• Hypervisor
• Para – Virtualization
o Problems
• Full – Virtualization
CS3551 - DISTRIBUTED SYSTEMS Important 2 marks and 16 marks

o Host Based Virtualization

• Pros and Cons of Virtualization

4. Explain Cloud Services and Platforms: Compute Services.

• Amazon Elastic Compute Cloud

o Launching an EC2 instance
o Stop instances
• Windows Azure

5. Explain the Application Services of Cloud.

• Application Framework and Runtime: Google App Engine

o Major feature of Google App Engine
o Key feature of GAE Programming mode using Java and Python
▪ Python
▪ Java
o Queuing Service: Amazon Simple Queue Service
▪ Example.