Skip Navigation

The Computer Journal 1989 32(3):267-272; doi:10.1093/comjnl/32.3.267
© 1989 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Schiper, A.
Right arrow Articles by Sengstag, J.-A.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Efficient Implementation of Rendezvous

A. Schiper *, R. Simon *, Ph. Desarzens * and J.-A. Sengstag *

Ecole Polytechnique Federale, Laboratoire de Systemes d'Exploitation, MA-Ecublens, CH-1015 Lausanne, Switzerland

In this paper we present a simple and efficient implementation of the rendezvous developed for a small multiprocessor system (6–10 processors). At first, we present the communication primitives with their traditional implementation. Secondly, we discuss in details our implementation and the communication architecture needed. We conclude with an evaluation showing that our implementation needs a maximum of four context switches to realize a rendezvous, which can be considered as an ideal result.

Received July 1987. revised March 1988.

* Ecole Polytechnique Fédérale, Laboratoire de Systèmes d'Exploitation, MA-Ecublens, CH-1015 Lausanne, Switzerland


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.