Cart (Loading....) | Create Account
Close category search window

Logically instantaneous message passing in asynchronous distributed systems

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

2 Author(s)
Soneoka, T. ; Dept. of Technol. Res., NTT Software Labs., Tokyo, Japan ; Ibaraki, T.

Asynchrony (due to unknown message transmission delay) complicates the design of protocols for distributed systems. To simplify the protocol design task therefore, the authors propose an interprocess (point-to-point) communication mechanism that has the characteristic of instantaneous message passing. They first establish a hierarchy among synchronization properties, which shows that to ensure the logically instantaneous message passing property it is not always necessary to use a rendezvous mechanism. Next, they propose a solution to the logically instantaneous message passing problem that is more efficient than R. Bagrodia's (1989) rendezvous and K.J. Goldman's (1991) logically synchronous multicast in the point-to-point (single-cast) setting. This algorithm has the following properties: it is applicable without deadlock to the partner model in which each process acts as both client and server; it requires three control messages to send an application message, which is shown to be quasioptimum message complexity; and its worst-case response time from a send request to the occurrence of the corresponding send event is 2kΔ (sec.), where k is the maximum number of interfering send requests and Δ (sec.) is an assumed upper bound on interprocess communication delay. Furthermore, two modified algorithms are proposed: one for reducing the number of control messages required for an application message, and the other for attaining a shorter average response time by using a randomization technique

Published in:

Computers, IEEE Transactions on  (Volume:43 ,  Issue: 5 )

Date of Publication:

May 1994

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.