Abstract
Concurrent programming languages including CSP and Ada use synchronous message-passing to define communication between a pair of asynchronous 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 of all possible pairs and the case where the set of next allowable interactions is of cardinality one. For the latter, the optimized algorithm also improves upon the best case delay for synchronization. The client-server computing model, the producerconsumer interaction, and interaction between processes executing parallelized tasks represent some broad classes of computations which can leverage the proposed improvements.
Chapter PDF
Similar content being viewed by others
Keywords
- Communication Sequential Process
- Message Overhead
- Synchronous Communication
- Asynchronous Process
- Synchronous Programming
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ada 95 Reference Manual (RM) Version 6.0: Intermetrics, Inc., January 1995. (URL http://lglwww.epfl.ch/Ada/rm95)
R. Bagrodia, Synchronization of asynchronous processes in CSP, ACM TOPLAS, 11(4):585–597, 1989.
A. Bernstein, Output guards and nondeterminism in communicating sequential processes, A CM TOPLAS, 2(2):234–238, April 1980.
G. Buckley, A, Silberschatz, An effective implementation of the generalized input-output construct of CSP, ACM TOPLAS, 5(2):223–235, April 1983.
M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1978.
C. A. R. Hoare, Communication sequential processes, CACM, 21(8):666–677, Aug. 1978.
F. Schneider, Synchronization in distributed processes, ACM TOPLAS, 4(2): 125–148, April 1982.
J. Schwarz, Distributed synchronization of communicating sequential processes, Tech. Report, University of Edinburgh, July 1978.
Van de Snepscheut, Synchronous communication between asynchronous components, Information Processing Letters, 13(3): 127–130, Dec. 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lodha, S., Chandra, P., Kshemkalyani, A., Rawat, M. (2001). Efficient Synchronization of Asynchronous Processes. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_50
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive