22C: 166 Distributed Systems and Algorithms
Homework 1, Total points = 60
Assigned 9/9/08 due 9/16/08 in class
Please submit typewritten solutions. Late assignments will not be accepted without prior approval.
You need not write executable codes, but the cl arity of the answer reflecting the main idea is very
important.
(Page 52-53) Chapter 3.
Exercise 6 (Since processes do not have names to begin with, initially all are
equal. Randomization is an easy way of symmetry breaking.)
Exercise 7 (Direct communication means 1-hop communication and indirect
communication means multi-hop communication. You have to make sure that the
number of messages does not grow indefinitely, and when the computation
terminates, no message is in transit)
Exercise 14 (Assume that the topology is completely connected)
(Page 66-67) Chapter 4
Exercises 6 (The coordinate of each robot is a shared variable for the process
controlling it. Assume that each robot takes zero time to move from one point to
another.)
Exercise 12
(Page 85-86) Chapter 5
Exercise 5