The Community for Technology Leaders
Green Image
<p>The author presents a simple solution for the committee coordination problem, which encompasses the synchronization and exclusion problems associated with implementing multiway rendezvous, and shows how it can be implemented to develop a family of algorithms. The algorithms use message counts to solve the synchronization problem, and they solve the exclusion problem by using a circulating token or by using auxiliary resources as in the solutions for the dining or drinking philosophers' problems. Results of a simulation study of the performance of the algorithms are presented. The experiments measured the response time and message complexity of each algorithm as a function of variations in the model parameters, including network topology and level of conflict in the system. The results show that the response time for algorithms proposed is significantly better than for existing algorithms, whereas the message complexity is considerably worse.</p>
process synchronization; performance evaluation; distributed algorithms; committee coordination problem; multiway rendezvous; message counts; synchronization problem; exclusion problem; circulating token; auxiliary resources; simulation study; response time; message complexity; model parameters; network topology; level of conflict; computational complexity; message switching; network topology; synchronisation

R. Bagrodia, "Process Synchronization: Design and Performance Evaluation of Distributed Algorithms," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 1053-1065, 1989.
87 ms
(Ver 3.3 (11022016))