Polling primitive for hypercube networks

Andrzej Czygrinow, M. Karonski, V. S. Sunderam

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

1 Scopus citations

Abstract

We describe a distributed computing primitive termed polling that is both a means of synchronization and communication in distributed or concurrent systems. The polling operation involves the collection of messages from nodes in an interconnection network, in response to a query. We define the semantics of polling, and present algorithms for implementing the operation on hypercube networks. Time and message lower bounds are presented, and is followed by an analysis of the number of operations performed at each node for each of the different algorithms. We then present empirical results and discuss the characteristics of each algorithm in relation to observed performance.

Original languageEnglish (US)
Title of host publicationIEEE Symposium on Parallel and Distributed Processing - Proceedings
PublisherIEEE
Pages138-144
Number of pages7
Publication statusPublished - 1995
Externally publishedYes
EventProceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, USA
Duration: Oct 25 1995Oct 28 1995

Other

OtherProceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing
CitySan Antonio, TX, USA
Period10/25/9510/28/95

    Fingerprint

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Czygrinow, A., Karonski, M., & Sunderam, V. S. (1995). Polling primitive for hypercube networks. In IEEE Symposium on Parallel and Distributed Processing - Proceedings (pp. 138-144). IEEE.