Scribd
Upload
221 views1 page

Network and Clock Algorithms Analysis

The document contains 6 tasks for an assignment: 1) Draw Omega and Butterfly networks for 16 inputs/outputs. 2) Explain why receive calls cannot be asynchronous. 3) Show events on the past/future cones of an event are send/receive messages. 4) Propose a technique like Singhal-Kshemkalyani's to reduce matrix clock size. 5) Prove a property of mutually concurrent vector timestamps. 6) Modify Chandy-Lamport to record a strongly consistent snapshot with empty channels.

Uploaded by

Anand Prakash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
221 views1 page

Network and Clock Algorithms Analysis

The document contains 6 tasks for an assignment: 1) Draw Omega and Butterfly networks for 16 inputs/outputs. 2) Explain why receive calls cannot be asynchronous. 3) Show events on the past/future cones of an event are send/receive messages. 4) Propose a technique like Singhal-Kshemkalyani's to reduce matrix clock size. 5) Prove a property of mutually concurrent vector timestamps. 6) Modify Chandy-Lamport to record a strongly consistent snapshot with empty channels.

Uploaded by

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

Assignment 1

1. Draw the Omega and Butterfly networks for n = 16 inputs and outputs.
2. Explain why a Receive call cannot be asynchronous.
3. Show that all events on the surface of the past cone of an event are message send events.
Likewise, show that all events on the surface of the future cone of an event are message
receive events.
4. The size of matrix clocks is quadratic with respect to the system size. Hence the message
overhead is likely to be substantial. Propose a technique for matrix clocks similar to that of
Singhal–Kshemkalyani to decrease the volume of information transmitted in messages and
stored at processes.
5. If events corresponding to vector timestamps {Vt1 , Vt2 ,....,Vtn} are mutually concurrent,
then prove that
(Vt1[1], Vt2 [2],...., Vtn[n]) = max(Vt1 , Vt2 , ..., Vtn).
6. What modifications should be done to the Chandy–Lamport snapshot algorithm so that it
records a strongly consistent snapshot (i.e., all channel states are recorded empty).

*************

You might also like