Scribd
Upload
20 views3 pages

Unit II 2 Marks With Answer

distributed system 2 mark Unit 1 full docment

Uploaded by

karuna karan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
20 views3 pages

Unit II 2 Marks With Answer

distributed system 2 mark Unit 1 full docment

Uploaded by

karuna karan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1|Page

Department of Computer Science and Engineering

CS8603 Distributed Systems

UNIT-2

MESSAGE ORDERING AND SNAPSHOTS

PART-A

1. What are the message ordering paradigms?

The order of delivery of messages in a distributed system is an important aspect of system executions
because it determines the messaging behavior that can be expected by the distributed program.

Several orderings on messages have been defined: (i) non-FIFO, (ii) FIFO, (iii) causal order, and (iv)
synchronous order.

2. What is Realizable synchronous communication?

An A-execution (E,≺) is an RSC execution if and only if there exists a non-separated linear extension of the partial
order (E,≺)
3. What is non-separated linear extension?
A non-separated linear extension of (E,≺) is a linear extension of (E,≺) such that for each pair (s, r) ∈ T, the
interval {x ∈ E | s ≺ x ≺ r } is empty.
4. Compare closed group and open group algorithm.

open group algorithm closed group algorithm


If a multicast algorithm requires the sender to be If the sender of the multicast can be outside the
a part of the destination group, the multicast destination group, the multicast algorithm is said
algorithm is said to be a closed group algorithm to be an open group algorithm.
Open group algorithms are more general, and Closed group algorithms cannot be used in
therefore more difficult to design and more several scenarios such as in a large system (e.g.,
expensive to implement, than closed group on-line reservation or Internet banking systems)
algorithms. where client processes are short-lived and in
large
numbers

5. State crown criterion theorem.


The crown criterion states that an A-computation is RSC, i.e., it can be realized on a system with
synchronous communication, if and only if it contains no crown.An execution is not RSC and its
graph G_→ contains a cycle if and only if in the corresponding space–time diagram, it is possible to
form a cycle by (i) moving along message arrows in either direction, but (ii) always going left to right
along the time line of any process.
6. What is message broadcast?

Prepared by Elavarasi D,
AP/CSE, MZCET
2|Page

A message broadcast is the sending of a message to all members in the distributed system. The
notion
of a system can be confined only to those sites/processes participating in the joint application.
7. Define time stamp.
A timestamp is the current time of an event that is recorded by a computer. The timestamp
mechanism is used for a wide variety of synchronization purposes, such as assigning a sequence
order for a multi-event transaction so that if a failure occurs the transaction can be voided.

8. Define multiway rendezvous and binary rendezvous.


One form of group communication is called multiway rendezvous, which is a synchronous
communication among an arbitrary number of asynchronous processes. All the processes involved
“meet with each other,” i.e., communicate “synchronously” with each other at one time. The
solutions to this problem are fairly complex rendezvous between a pair of processes at a time, which
is called binary rendezvous as opposed to the multiway rendezvous.

9. Differentiate multicasting Vs unicasting.


There is multicasting wherein a message is sent to a certain subset, identified as a group, of the
processes in the system. At the other extreme is unicasting, which is the familiar point-to-point message
communication.
10. Identify the two popular orders for the delivery of messages in group communication.

Casual order, Total Order

11. Identify consistent snapshot.


Consistent snapshot of a distributed system captures stable properties. Consistent snapshot of a
distributed computation is taken after the distributed computation has terminated, the snapshot
will capture the termination of the computation.

12. List and define the criteria that must be met by a causal ordering protocol.
The following two criteria must be met by a causal ordering protocol:
Safety: In order to prevent causal order from being violated, a message M that arrives at a process
may need to be buffered until all system wide messages sent in the causal past of the send(M) event
to that same destination have already arrived.
Liveness: A message that arrives at a process must eventually be delivered to the process.

13. What are the necessary conditions to satisfy the consistent global state?
In this consistent global state, for any two local states si and sj at Pi and Pj , respectively, the following
must hold: (mutually concurrent) ∀I,∀j, si≺ sj ∧ sj≺ si_

14. State the property for causal delivery of messages.

The causal ordering of these events by three rules:


 If A and B happen on the same machine and A happens before B then A -> B
 If I send you some message M and you receive it then (send M) -> (recv M)
 If A -> B and B -> C then A -> C

15. Sketch an interpretation in terms of a cut.

Prepared by Elavarasi D,
AP/CSE, MZCET
3|Page

A cut is a line joining an arbitrary point on each process line that slices the space–time diagram into a
PAST and a FUTURE.
A consistent global state corresponds to a cut in which every message received in the PAST of the cut
has been sent in the PAST of that cut. Such a cut is known as a consistent cut.

16. What is consistent cut?


A consistent global state corresponds to a cut in which every message received in the PAST of the
cut has been sent in the PAST of that cut. Such a cut is known as a consistent cut.
17. Outline marker sending rule.

A process initiates snapshot collection by executing the marker sending rule by which it records its local
state and sends a marker on each outgoing channel.

18. What is marker receiving rule?


A process executes the marker receiving rule on receiving a marker. The state of the incoming
channel on which the marker is received is recorded as the set of computation messages received
on that channel after recording the local state but before receiving the marker on that channel.

19. What is complexity?


The performance of sequential algorithms is measured using the time and space complexity in terms
of the lower bounds (Ω,ω) representing the best case, the upper bounds (O_ o) representing the
worst case, and the exact bound (θ).

20. Show how to prove the correctness of the algorithm


Suppose two sites Si and Sj are executing
the CS concurrently. For this to happen conditions L1 and L2 must hold at both the sites
concurrently. This implies that at some instant in time, say t, both Si and Sj have their own requests
at the top of their request_queues and condition L1 holds at them.
This implies that Sj’s own request is at the top of its own request_queue when a smaller timestamp
request, Si’s request, is present in the request_queuej – a contradiction!

Prepared by Elavarasi D,
AP/CSE, MZCET

You might also like