research-article

A Survey of Synchronization Methods for Parallel Computers

Author:

Anne DinningAuthors Info & Claims

Computer, Volume 22, Issue 7

Pages 66 - 77

https://doi.org/10.1109/2.30733

Published: 01 July 1989 Publication History

Publisher Site

Abstract

An examination is given of how traditional synchronization methods influence the design of MIMD (multiple-instruction multiple-data-stream) multiprocessors. She provides an overview of MIMD multiprocessing and goes on to discuss semaphore-based implementations (Ultracomputers, Cedar, and the Sequent Balance/21000), monitor-based implementations (the HM/sup 2/p) and implementations based on message-passing (HEP, the BBN Butterfly and the Transputer).

References

[1]

1. G.R. Andrew and F.B. Schneider, "Concepts and Notations for Concurrent Programming," Computing Surveys, Vol. 15, No. 1, Mar. 1983, pp. 3-43.

Digital Library

Google Scholar

[2]

2. E.J. Dijkstra, "Hierarchical Ordering of Sequential Processes," Acta Informatica, Vol. 1, 1971, pp. 115-132.

Digital Library

Google Scholar

[3]

3. C.A.R. Hoare, "An Axiomatic Basis for Computer Programming," Comm. ACM, Vol. 12, No. 10, Oct. 1969, pp. 576-580.

Digital Library

Google Scholar

[4]

4. A. Gottlieb, "An Overview of the NYU Ultracomputer Project," Technical Report Ultracomputer Note No. 100, New York University, July 1986.

Google Scholar

[5]

5. G.F. Pfister et al., "The IBM Research Parallel Processor Prototype (RP3): Introduction and Architecture," Proc. 1985 Parallel Processing Conf., Computer Society Press, Los Alamitos, Calif., No. 637, pp. 764-771.

Google Scholar

[6]

6. D. Kuck et al., "Parallel Supercomputing Today and the Cedar Approach," in Experimental Parallel Computing Architectures, J. Dongarra, ed., Elsevier, New York, 1987.

Google Scholar

[7]

7. T.-C. Yew and C.-Q, Zhu, "A Synchronization Scheme and Its Applications for Large Multiprocessor Systems," Proc. Fourth Int'l Conf. Distributed Computing Systems, Computer Society Press, Los Alamitos, Calif., No. 534, 1984, pp. 486-491.

Google Scholar

[8]

8. B. Beck and B. Kasten, "VLSI Assist in Building a Multiprocessor Unix System," Proc. Usenix Conf. Exhibition, June 1985, pp. 255- 275.

Google Scholar

[9]

9. C.A.R. Hoare, "Monitors: An Operating System Structuring Concept," Comm. ACM, Vol. 17, No. 10, Oct. 1974, pp. 549-557; corrigendum in Comm. ACM, Vol. 18, No. 2, Feb. 1975.

Digital Library

Google Scholar

[10]

10. K.G. Shin, Y. Lee, and J. Sasidhar, "Design of HM<sup>2</sup>p--A Hierarchical Multiprocessor for General-Purpose Applications," IEEE Trans. Computers, Vol. C-31, No. 11, Nov. 1982, pp. 1045-1053.

Google Scholar

[11]

11. E.J. Dijkstra, "Guarded Commands, Non-Determinism and a Calculus for the Derivation of Programs," Comm. ACM, Vol. 18, No. 8, Aug. 1975, pp. 453-457.

Digital Library

Google Scholar

[12]

12. H.F. Jordan, "HEP Architecture, Programming and Performance," in Parallel MIMD Computation: The HEP Supercomputer and Its Applications, J. Kowalik, ed., MIT Press, Cambridge, Mass., 1985, pp. 1-40.

Crossref

Google Scholar

[13]

13. "Butterfly Parallel Processor Overview," BBN Report No. 6148, BBN Laboratories, Cambridge, Mass., Mar. 1986.

Google Scholar

[14]

14. C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood Cliffs, N.J., 1985.

Crossref

Google Scholar

[15]

15. Colin Whitby-Strevens, "The Transputer," Proc. 12th Int'l Computer Architecture Symp., Computer Society Press, Los Alamitos, Calif., No. 634, 1985, pp. 292-300.

Crossref

Google Scholar

Cited By

View all

Soriano-Salvador EMuzquiz GBallesteros F(2015)Optimistic semaphores with non-deterministic choice operation for heterogeneous manycore systemsConcurrency and Computation: Practice & Experience10.1002/cpe.336327:14(3676-3701)Online publication date: 25-Sep-2015
https://dl.acm.org/doi/10.1002/cpe.3363
Wenzel S(2005)Automatic detection of incomplete instances of structural patterns in UML class diagramsNordic Journal of Computing10.5555/1142774.114277912:4(379-394)Online publication date: 29-Aug-2005
https://dl.acm.org/doi/10.5555/1142774.1142779
Neilforoshan M(2005)Synchronization and cache coherence in computer designJournal of Computing Sciences in Colleges10.5555/1089053.108910421:2(341-348)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.5555/1089053.1089104
Show More Cited By

Index Terms

A Survey of Synchronization Methods for Parallel Computers

Recommendations

Data-Parallel Programming on MIMD Computers

The implementation of two compilers for the data-parallel programming language Dataparallel C is described. One compiler generates code for Intel and nCUBE hypercube multicomputers; the other generates code for Sequent multiprocessors. A suite of ...
Scheduling non-uniform parallel loops on MIMD computers
Programming Three Parallel Computers

Three commercial systems are considered from a programmer's point of view. The three are the Intel iPSC, a network of Inmos transputers, and the Sequent Balance. The differences in overhead are examined by implementing a solution to the traveling-...

Reviews

Reviewer: Helmar Burkhart

Dinning introduces three traditional synchronization methods and discusses how they have been integrated in the design of multiprocessors. The methods presented are semaphores, monitors, and message passing; the systems referenced are the Ultracomputer, Cedar, Sequent, HM 2 p, Hep, BBN Butterfly, and Transputer. This survey contains nothing original: readers with a certain background in parallel processing have probably seen the text passages before. The description is purely qualitative; I expected some performance figures for the different schemes. I also missed some remarks on other systems, such as the Intel 432, that include hardware support for message passing. Finally, I would have made some comments about the drawbacks of current microprocessors, which typically provide only test_and_set and compare_and_swap functions. Nevertheless, the author does a good job for readers who have a background in operating systems but no knowledge of parallel processors. In 12 pages she gives a careful selection of relevant material. These readers will definitely like this paper.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Information & Contributors

Information

Published In

Computer Volume 22, Issue 7

July 1989

94 pages

ISSN:0018-9162

Editor:
Bruce D. Shriver
Univ. of Southwestern Louisiana, Lafayette

Issue’s Table of Contents

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 July 1989

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Soriano-Salvador EMuzquiz GBallesteros F(2015)Optimistic semaphores with non-deterministic choice operation for heterogeneous manycore systemsConcurrency and Computation: Practice & Experience10.1002/cpe.336327:14(3676-3701)Online publication date: 25-Sep-2015
https://dl.acm.org/doi/10.1002/cpe.3363
Wenzel S(2005)Automatic detection of incomplete instances of structural patterns in UML class diagramsNordic Journal of Computing10.5555/1142774.114277912:4(379-394)Online publication date: 29-Aug-2005
https://dl.acm.org/doi/10.5555/1142774.1142779
Neilforoshan M(2005)Synchronization and cache coherence in computer designJournal of Computing Sciences in Colleges10.5555/1089053.108910421:2(341-348)Online publication date: 1-Dec-2005
https://dl.acm.org/doi/10.5555/1089053.1089104
Hwang GChang SChu H(2004)Technology for Testing Nondeterministic Client/Server Database ApplicationsIEEE Transactions on Software Engineering10.1109/TSE.2004.126573630:1(59-77)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.1109/TSE.2004.1265736
Caspi PGirault APilaud D(1999)Automatic Distribution of Reactive Systems for Asynchronous Networks of ProcessorsIEEE Transactions on Software Engineering10.1109/32.79832925:3(416-427)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1109/32.798329
Bowen NElko DIsenberg JWang G(1997)A locking facility for parallel systemsIBM Systems Journal10.1147/sj.362.020236:2(202-220)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.1147/sj.362.0202
Seung-Ju JGil-Yong K(1994)Spin-block synchronization algorithm in the shared memory multiprocessor systemACM SIGOPS Operating Systems Review10.1145/191525.19153028:4(15-30)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/191525.191530
Malloy BLloyd ESoffa M(1994)Scheduling DAG's for Asynchronous Multiprocessor ExecutionIEEE Transactions on Parallel and Distributed Systems10.1109/71.2825605:5(498-508)Online publication date: 1-May-1994
https://dl.acm.org/doi/10.1109/71.282560
Linder DHarden J(1994)Access GraphsIEEE Transactions on Parallel and Distributed Systems10.1109/71.2625875:1(39-52)Online publication date: 1-Jan-1994
https://dl.acm.org/doi/10.1109/71.262587
Boguslavsky LHarzallah KKreinen ASevcik KVainshtein A(1994)Optimal Strategies for Spinning and BlockingJournal of Parallel and Distributed Computing10.1006/jpdc.1994.105621:2(246-254)Online publication date: 1-May-1994
https://dl.acm.org/doi/10.1006/jpdc.1994.1056
Show More Cited By

Abstract

References

Cited By

Index Terms

Recommendations

Data-Parallel Programming on MIMD Computers

Scheduling non-uniform parallel loops on MIMD computers

Programming Three Parallel Computers

Reviews

Access critical reviews of Computing literature here

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations