Delay-insensitive solutions to the committee problem

The committee problem involves the specification and design of a scheduler for committee meetings. It is a general resource allocation problem that combines both synchronization and mutual exclusion. We give a simple specification of a scheduler and present three delay-insensitive implementations. Our last implementation contains a high degree of parallelism and is simpler than previously proposed implementations.

[1]  Nissim Francez,et al.  Script: A Communication Abstraction Mechanism and Its Verification , 1989, Sci. Comput. Program..

[2]  K. Mani Chandy,et al.  Parallel program design - a foundation , 1988 .

[3]  Adriano Valenzano,et al.  A Protocol for Multirendezvous of LOTOS Processes , 1991, IEEE Trans. Computers.

[4]  S. Ramesh,et al.  A New and Efficient Implementation of Multiprocess Synchronization , 1987, PARLE.

[5]  T Tom Verhoeff,et al.  A theory of delay-insensitive systems , 1994 .

[6]  M. B. Josephs,et al.  An overview of D-I algebra , 1993, [1993] Proceedings of the Twenty-sixth Hawaii International Conference on System Sciences.

[7]  D. Kumar.  An implementation of N-party synchronization using tokens , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[8]  Jayadev Misra,et al.  Phase Synchronization , 1991, Inf. Process. Lett..

[9]  Arthur Charlesworth,et al.  The multiway rendezvous , 1987, TOPL.

[10]  Ronald A. Olsson,et al.  An SR Approach to Multiway Rendezvous , 1989, Comput. Lang..

[11]  Rajive L. Bagrodia.  A Distributed Algorithm to Implement N-Party Rendevouz , 1987, FSTTCS.