Efficient Synchronization of Asynchronous Processes

Authors:
Sandeep Lodha;Punit Chandra;Ajay D. Kshemkalyani;Mayank Rawat
Affiliations:
-;-;-;-
Venue:
Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Year:
2001

Citing 6
Cited 0

Parallel program design: a foundation

Parallel program design: a foundation
Synchronization of asynchronous processes in CSP

ACM Transactions on Programming Languages and Systems (TOPLAS)
Output Guards and Nondeterminism in “Communicating Sequential Processes”

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronization in Distributed Programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Effective Implementation for the Generalized Input-Output Construct of CSP

ACM Transactions on Programming Languages and Systems (TOPLAS)
Communicating sequential processes

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

Concurrent programming languages including CSP and Ada use synchronous message-passing to define communication between a pair ofa synchronous processes. This paper presents an efficient way to synchronize these processes by improving on Bagrodia's algorithm that provides binary rendezvous. Simulation results are presented to show the better performance of the optimized algorithm for two cases - the case where the interaction set is composed ofall possible pairs and the case where the set ofn ext allowable interactions is ofcard inality one. For the latter, the optimized algorithm also improves upon the best case delay for synchronization. The client-server computing model, the producer-consumer interaction, and interaction between processes executing parallelized tasks represent some broad classes of computations which can leverage the proposed improvements.