Barrier synchronization in distributed-memory multiprocessors using rendezvous primitives

S. K.S. Gupta, D. K. Panda

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings of 7th International Parallel Processing Symposium, IPPS 1993
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages501-505
Number of pages5
ISBN (Electronic)0818634421, 9780818634420
DOIs
StatePublished - Jan 1 1993
Externally publishedYes
Event7th International Parallel Processing Symposium, IPPS 1993 - Newport, United States
Duration: Apr 13 1993Apr 16 1993

Publication series

NameProceedings of 7th International Parallel Processing Symposium, IPPS 1993

Conference

Conference7th International Parallel Processing Symposium, IPPS 1993
CountryUnited States
CityNewport
Period4/13/934/16/93

ASJC Scopus subject areas

  • Computer Science Applications
  • Hardware and Architecture
  • Software
  • Computational Theory and Mathematics
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Barrier synchronization in distributed-memory multiprocessors using rendezvous primitives'. Together they form a unique fingerprint.

  • Cite this

    Gupta, S. K. S., & Panda, D. K. (1993). Barrier synchronization in distributed-memory multiprocessors using rendezvous primitives. In Proceedings of 7th International Parallel Processing Symposium, IPPS 1993 (pp. 501-505). [262826] (Proceedings of 7th International Parallel Processing Symposium, IPPS 1993). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPPS.1993.262826