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 language | English (US) |
|---|---|
| Title of host publication | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
| Publisher | IEEE |
| Pages | 138-144 |
| Number of pages | 7 |
| State | Published - 1995 |
| Externally published | Yes |
| Event | Proceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing - San Antonio, TX, USA Duration: Oct 25 1995 → Oct 28 1995 |
Other
| Other | Proceedings of the 1995 7th IEEE Symposium on Parallel and Distributed Processing |
|---|---|
| City | San Antonio, TX, USA |
| Period | 10/25/95 → 10/28/95 |
ASJC Scopus subject areas
- Engineering(all)