The Community for Technology Leaders
14th International Conference on Distributed Computing Systems (1994)
Pozman, Poland
June 21, 1994 to June 24, 1994
ISBN: 0-8186-5840-1
pp: 250-257
L. Shabtay , Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
ABSTRACT
A new message-delaying version of synchronizer /spl gamma/, named /spl zeta/, is presented. Synchronizer /spl zeta/ 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 /spl zeta/. 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 /spl zeta/ to O(z+log/sub k/ |V|) per pulse. The tradeoff between memory overhead and time complexity achieved by the z-partition algorithm is optimal.<>
INDEX TERMS
communication complexity, computational complexity, protocols, storage management, message passing, synchronisation
CITATION

L. Shabtay and A. Segall, "A synchronizer with low memory overhead," 14th International Conference on Distributed Computing Systems(ICDCS), Pozman, Poland, 1994, pp. 250-257.
doi:10.1109/ICDCS.1994.302420
98 ms
(Ver 3.3 (11022016))