Changes between Version 9 and Version 10 of Challenge

Timestamp:

03/12/19 04:02:23 (7 years ago)

Author:

siegel

Comment:

--

Challenge

@@ -5 +5 @@
 A barrier is a synchronization operation that is invoked by all threads or processes
 in a concurrent system.  The defining property is that no process can leave
-the barrier until every process has entered the barrier.  A barrier should also
-be re-useable, i.e., it can be invoked more than once.
+the barrier until every process has entered the barrier.  Of course, a barrier
+should not deadlock --- once all processes have entered, they should all
+be able to leave.   A barrier should also be re-useable, i.e., it can be invoked
+more than once.
 
 The dissemination barrier works as follows.   There are n processes, numbered
-0 .. n-1.    The ordere is treated as cyclical.   The protocol goes through
-ceil(log_2(n)) stages.   At stage i, each process sends a message to the process
-2^i to its "right", and waits to receive a message from the process 2^i to its "left".
+0 .. n-1.    The order is treated as cyclical.   The protocol goes through
+ceil(log,,2,,(n)) stages, i=0,1,....   At stage i, each process sends a message to the process
+2^i^ to its "right", and waits to receive a message from the process 2^i^ to its "left".
 The content of the message is irrelevant (and can be empty).