research article
Efficient Implementation of Rendezvous
1989
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.
Type
research article
Web of Science ID
WOS:A1989AB96500012
Author(s)
Date Issued
1989
Published in
Volume
32
Issue
3
Start page
267
End page
272
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
July 27, 2006
Use this identifier to reference this record