System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Distributed implementation of multi-rendezvous in LOTOS using the orthogonal communication structure in Linda

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Naik, K. ; Dept. of Comput. Software, Aizu Univ., Fukushima, Japan

We argue that the programming simplicity and message passing complexity of implementing LOTOS multi-rendezvous largely depends on the underlying communication structure. The programming simplicity and low complexity of our algorithm are due to our viewing the multi-rendezvous problem as a distributed mutual exclusion problem. Using the parallel programming environment of Linda, we present an efficient algorithm to easily implement multi-rendezvous in LOTOS. The orthogonal communication structure in Linda allows us to separate synchronization concerns in multi-rendezvous from concerns in interprocess communication in an implementation. The concept, of Table Space in Linda and the associated in, out, and rd primitives for managing the tuple space lead to an elegant programming style for distributed implementation of multi-rendezvous

Published in:

Distributed Computing Systems, 1995., Proceedings of the 15th International Conference on

Date of Conference:

30 May-2 Jun 1995