Assignment 1: Due to Sat. Apr. 7th

Solve the following problems from the textbook.

Chapter 1:  2, 14, 15, 16, 20, 25

Assignment 2: Due to Sat. May 26th

Suppose we have an interconnected parallel computer with n identical CPUs that operate asynchronously (i.e., they have no global clock). All CPUs have to choose between two colors say white or black. At the beginning each CPU may choose any color independently of the others, but we would like eventually to coordinate between the CPUs so either all CPUs choose white or all CPUs choose black. Design an algorithm to make sure that all CPUs agree on the same choice. You may assume that each CPU has a constant number of local registers and there is a constant number of common global registers that are accessible by all CPUs.