An SR approach to multiway rendezvous

Authors:
Michael Coffin;Ronald A. Olsson
Affiliations:
Department of Computer Science, University of Arizona, Tucson, AZ 85721 U.S.A.;Division of Computer Science, University of California, Davis, CA 95616 U.S.A.
Venue:
Computer Languages
Year:
1989

Citing 8
Cited 1

The multiway rendezvous

ACM Transactions on Programming Languages and Systems (TOPLAS)
The butterfly barrier

International Journal of Parallel Programming
An overview of the SR language and implementation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronizing Resources

ACM Transactions on Programming Languages and Systems (TOPLAS)
Guardians and Actions: Linguistic Support for Robust, Distributed Programs

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

Communications of the ACM
One-to-many interprocess communication in the V-system

SIGCOMM '84 Proceedings of the ACM SIGCOMM symposium on Communications architectures and protocols: tutorials & symposium
The V Kernel: A Software Base for Distributed Systems

IEEE Software

New mechanisms for invocation handling in concurrent programming languages11This research is supported in part by the National Science Foundation under Grant CCR-9527295

Computer Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new approach to programming multiway rendezvous problems in the SR language. The approach uses SR's concurrent invocation statement and rendezvous mechanism to coordinate the interacting processes. This approach is compared with one that suggested an extension to SR's rendezvous mechanism. The two approaches result in differing program structure. The new approach is shown to lead to simpler and cleaner interfaces between the main process and the worker processes, and uses only existing language mechanisms. The results are of importance to both programmers and designers of concurrent program languages.