@inproceedings{a21149ad81e94da6b79c25a59ad7f3ac,
title = "Barrier synchronization in distributed-memory multiprocessors using rendezvous primitives",
abstract = "This paper deals with barrier synchronization in wormhole routed distributed-memory multiprocessors. New rendezvous and multirendezvous synchronization primitives are proposed to implement a barrier between two and multiple processors, respectively. These primitives reduce the number of communication steps required to implement a barrier; thus, significantly reducing the synchronization overhead for networks with high communication start-up cost. Two algorithms for barrier synchronization on k-ary n-cube networks are presented. The rendezvous primitive allows one to synchronize all processors in nlog2(k) steps. The multirendezvous primitive allows one to synchronize an arbitrary subset of processors in optimal number of communication steps depending on the ratio of the communication start-up (ts) to the link-propagation (tp) cost.",
author = "Gupta, {S. K.S.} and Panda, {D. K.}",
year = "1993",
month = jan,
day = "1",
doi = "10.1109/IPPS.1993.262826",
language = "English (US)",
series = "Proceedings of 7th International Parallel Processing Symposium, IPPS 1993",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "501--505",
booktitle = "Proceedings of 7th International Parallel Processing Symposium, IPPS 1993",
note = "7th International Parallel Processing Symposium, IPPS 1993 ; Conference date: 13-04-1993 Through 16-04-1993",
}