Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

A synchronizer with low memory overhead

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)
Shabtay, L. ; Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel ; Segall, A.

A new message-delaying version of synchronizer γ, named ζ, is presented. Synchronizer ζ ensures that original-protocol messages received by a node from nodes in the same cluster are never early, and thus, no buffers for their temporary storage are necessary. Only original-protocol messages on edges leading to nodes of other clusters (external edges) may be early. The z-partition algorithm is introduced to reduce the number of external edges connected to each node, thus reducing the memory overhead of ζ. For an arbitrary z, this algorithm ensures that the external degree of each node is no more than [|V|/z]-1. The z-partition algorithm increases the time complexity of ζ to O(z+logk |V|) per pulse. The tradeoff between memory overhead and time complexity achieved by the z-partition algorithm is optimal

Published in:

Distributed Computing Systems, 1994., Proceedings of the 14th International Conference on

Date of Conference:

21-24 Jun 1994