Abstract
A major difficulty in programming parallel computers is resolving the conflict between centralising data to ensure consistency and distributing data to ensure efficient access. Opportunistic combining networks can reduce access contention without compromising the efficiency of access. The implementation of two simple data structures (a parallel queue and a parallel stack) is described, and performance results obtained by simulation presented.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Robert Bjornson, Nicholas Carriero, David Gelernter, and Jerrold Leichter. Linda, the Portable Parallel. Research Report 520, Department of Computer Science, Yale University, 1988.
Henri E. Bal, Andrew S. Tanenbaum, and M. Frans Kaashoek. Orca: A Language for Distributed Programming. ACM SIGPLAN Notices, 25(5), May 1990.
Suresh Chittor and Richard Enbody. Minimizing Contention: A New Mapping Objective for Second-Generation Multicomputer. Technical report, Michigan State University, 1991.
Lyndon J. Clarke and Greg Wilson. Tiny: An Efficient Routing Harness for the Inmos Tranpsuter. Concurrency: Practice and Experience, 3(3), June 1991.
G. Fox, M. Johnson, G. Lyzenga, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors, Volume 1. Prentice-Hall, 1988.
Allan Gottlieb, Ralph Grishman, Clyde P. Kruskal, Kevin P. McAuliffe, Larry Rudolph, and Marc Snir. The NYU Ultracomputer — Designing and MIMD Shared Memory Parallel Computer. IEEE Trans. Computers, 32(2), February 1983.
Malcolm C. Harrison. The Add-and-Lambda Operation: An Extension of F&A. Technical Report 104, Ultracomputer Research Laboratory, July 1986.
Malcolm C. Harrison. Add-and-Lambda II: Eliminating Busy Waits. Technical Report 139, Ultracomputer Research Laboratory, July 1988.
Manoj Kumar and Gregory F. Pfister. The Onset of Hot Spot Contention. In Proc. 1986 Intl. Conf. on Parallel Processing, 1986.
Gyungho Lee, Clyde P. Kruskal, and David J. Kuck. The Effectiveness of Combining in Shared Memory Parallel Computers in the Presence of ‘Hot Spots'. In Proc. 1986 Intl. Conf. on Parallel Processing, 1986.
G.F Pfister, W. C. Brantley, D. A. George, S. L. Harvey, W. J. Kleinfelder, K. P. McAuliffe, E. A. Melton, V. A. Norton, and J. Weiss. The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture. In Proc. IEEE Intl. Conf. on Parallel Processing, 1985.
G.F Pfister and V. A. Norton. “Hot Spot” Contention and Combining in Multistage Interconnection Networks. In Proc. IEEE Intl. Conf. on Parallel Processing, 1985.
Franco P. Preparata and Jean Vuillemin. The Cube-Connected Cycles: A Versatile Network for Parallel Computation. Comm. ACM, 24(5), May 1981.
Karsten Schwan and Win Bo. Topologies: Distributed Objects on Multicomputers. ACM Trans. on Computer Systems, 8(2):111–157, 1990.
Robert H. Thomas. Behavior of the Butterfly Parallel Processor in the Presence of Memory Hot Spots. In Proc. 1986 Intl. Conf. on Parallel Processing, 1986.
Pen-Chung Yew, Nian-Feng Tzeng, and Duncan H. Lawrie. Distibuting Hot-Spot Addressing in Large-Scale Multiprocessors. In Proc. 1986 Intl. Conf. on Parallel Processing, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, G.V. (1992). Using Opportunistic combining networks to reduce contention in multicomputers. In: Etiemble, D., Syre, JC. (eds) PARLE '92 Parallel Architectures and Languages Europe. PARLE 1992. Lecture Notes in Computer Science, vol 605. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55599-4_116
Download citation
DOI: https://doi.org/10.1007/3-540-55599-4_116
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55599-5
Online ISBN: 978-3-540-47250-6
eBook Packages: Springer Book Archive