@inproceedings{FGOS-SBSPMPS-92,
Title = {Subset barrier synchronization on a private-memory parallel system},
Author = {Feldmann, Anja and Gross, Thomas and O'Hallaron, David and Stricker, Thomas M.},
Booktitle = {SPAA '92: Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures},
Pages = {209–218},
Year = {1992},
Isbn = {0-89791-483-X},
Doi = {http://dx.doi.org/10.1145/140901.140923},
Location = {San Diego, California, United States},
Address = {New York, NY, USA},
Publisher = {ACM Press},
Abstract = {A global barrier synchronizes all processors in a parallel system. This paper investigates algorithms that allow disjoint subsets of processors to synchronize independently and in parallel. The user model of a subset barrier is straight forward; a processor that participates in a subset barrier needs to know only the name of the barrier and the number of participating processors. This paper identifies two general communication models for private-memory parallel systems: the bounded buffer broadcast model and the anonymous destination message passing model and presents algorithms for barrier synchronization in the terms of these models. The models are detailed enough to allow meaningful cost estimates for their primitives, yet independent of a specific architecture and can be supported efficiently by a modern private-memory parallel system. The anonymous destination message passing model is the most attractive. The time complexity to synchronize over a uni-directional ring of N processors is O(log N) for common cases, and O(sqrt(N)) in the worst case. The algorithms have been implemented on iWarp, a private-memory parallel system and are now in daily use. The paper concludes with timing measurements obtained on a 64-node system.},
Url = {http://www.net.t-labs.tu-berlin.de/papers/FGOS-SBSPMPS-92.ps},
Keywords = {pssc},
Projectname = {thisisimportant}
}