Efficient synchronization of asynchronous processes

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 producerconsumer interaction, and interaction between processes executing parallelized tasks represent some broad classes ofcomp utations which can leverage the proposed improvements.