research-article

Multiprocessor Synchronization for Concurrent Loops

Author:

Michael WolfeAuthors Info & Claims

IEEE Software, Volume 5, Issue 1

Pages 34 - 42

https://doi.org/10.1109/52.1992

Published: 01 January 1988 Publication History

Publisher Site

Abstract

Execution of concurrent loops on multiprocessor computers often requires synchronizing the processors. Synchronization schemes are surveyed that are suitable for automatic problem decomposition. The model of a shared-memory multiprocessor is used, as is the concurrent-loop paradigm, which is to compile a loop so each processor is assigned a different loop iteration. The discussion covers data dependence, removing synchronization points, random synchronization, pipelining, barrier synchronization, and critical sections.

References

[1]

1. R. Cytron, "Doacross: Beyond Vectorization for Multiprocessors," Proc. Int'l Conf. Parallel Processing, CS Press, Los Alamitos, Calif., 1986, pp. 836-844.

Google Scholar

[2]

2. D.J. Kuck, The Structure of Computers and Computations, Vol. I, John Wiley & Sons, New York, 1978.

Crossref

Google Scholar

[3]

3. M. Wolfe and U. Banerjee, "Data Dependence and Its Application to Parallel Processing," Int'l J. Parallel Programming , April 1987.

Crossref

Google Scholar

[4]

4. S.P. Midkiff and D.A. Padua, "Compiler-Generated Synchronization for Do Loops," Proc. Int'l Conf. Parallel Processing , CS Press, Los Alamitos, Calif., 1986, pp. 544-551.

Google Scholar

[5]

5. J.R. Allen and K. Kennedy, "A Parallel Programming Environment," IEEE Software , July 1985, pp. 21-29.

Google Scholar

[6]

6. D. Padua, D. Kuck, and D. Lawrie, "High-Speed Multiprocessors and Compilation Techniques," IEEE Trans. Computers, Sept. 1980, pp. 763-776.

Google Scholar

Cited By

View all

Mastoras AGross T(2018)Understanding Parallelization Tradeoffs for Linear PipelinesProceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/3178442.3178443(1-10)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3178442.3178443
Cui YLiu SZou NWu W(2018)A Dynamic Parallel Strategy for DOACROSS LoopsProceedings of the International Conference on High Performance Computing in Asia-Pacific Region10.1145/3149457.3149469(108-115)Online publication date: 28-Jan-2018
https://dl.acm.org/doi/10.1145/3149457.3149469
Mastoras AGross T(2018)Unifying Fixed Code Mapping, Communication, Synchronization and Scheduling Algorithms for Efficient and Scalable Loop PipeliningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.281720729:9(2136-2149)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1109/TPDS.2018.2817207
Show More Cited By

Multiprocessor Synchronization for Concurrent Loops
1. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

Experience with Multiple Processor Versions of Concurrent C

Concurrent C, a superset of C providing parallel programming facilities, is considered. A uniprocessor version of Concurrent C was first implemented. After experience with this version, the Concurrent C implementation was extended to run on two types of ...
Redundant Synchronization Elimination for DOACROSS Loops

Cross-iterations data dependences in DOACROSS loops require explicit data synchronizations to enforce them. However, the composite effect of some data synchronizations may cover the other dependences and make the enforcement of those covered dependences ...
(R) Polynomial - Time Nested Loop Fusion with Full Parallelism
ICPP '96: Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3

Abstract: Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way of reducing synchronization and improving data locality. Traditional fusion ...

Comments

Information & Contributors

Information

Published In

IEEE Software Volume 5, Issue 1

January 1988

88 pages

ISSN:0740-7459

Issue’s Table of Contents

Publisher

IEEE Computer Society Press

Washington, DC, United States

Publication History

Published: 01 January 1988

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

12
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 16 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Mastoras AGross T(2018)Understanding Parallelization Tradeoffs for Linear PipelinesProceedings of the 9th International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/3178442.3178443(1-10)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3178442.3178443
Cui YLiu SZou NWu W(2018)A Dynamic Parallel Strategy for DOACROSS LoopsProceedings of the International Conference on High Performance Computing in Asia-Pacific Region10.1145/3149457.3149469(108-115)Online publication date: 28-Jan-2018
https://dl.acm.org/doi/10.1145/3149457.3149469
Mastoras AGross T(2018)Unifying Fixed Code Mapping, Communication, Synchronization and Scheduling Algorithms for Efficient and Scalable Loop PipeliningIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2018.281720729:9(2136-2149)Online publication date: 1-Sep-2018
https://dl.acm.org/doi/10.1109/TPDS.2018.2817207
Unnikrishnan PShirako JBarton KChatterjee SSilvera RSarkar V(2012)A practical approach to DOACROSS parallelizationProceedings of the 18th international conference on Parallel Processing10.1007/978-3-642-32820-6_23(219-231)Online publication date: 27-Aug-2012
https://dl.acm.org/doi/10.1007/978-3-642-32820-6_23
O'Boyle MStöhr E(2002)Compile Time Barrier Synchronization MinimizationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2002.101139413:6(529-543)Online publication date: 1-Jun-2002
https://dl.acm.org/doi/10.1109/TPDS.2002.1011394
Hwang R(1997)An Efficient Technique of Instruction Scheduling on a Superscalar-Based MulprocessorProceedings of the 11th International Symposium on Parallel Processing10.5555/645607.757930(33-39)Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.5555/645607.757930
Tsai JFujimoto R(1993)Automatic parallelization of discrete event simulation programsProceedings of the 25th conference on Winter simulation10.1145/256563.256818(697-705)Online publication date: 1-Dec-1993
https://dl.acm.org/doi/10.1145/256563.256818
Tang PYew PZhu CSameh Avan der Vorst H(1990)Compiler techniques for data synchronization in nested parallel loopsProceedings of the 4th international conference on Supercomputing10.1145/77726.255155(177-186)Online publication date: 1-Jun-1990
https://dl.acm.org/doi/10.1145/77726.255155
Tang PYew PZhu C(1990)Compiler techniques for data synchronization in nested parallel loopsACM SIGARCH Computer Architecture News10.1145/255129.25515518:3b(177-186)Online publication date: 1-Jun-1990
https://dl.acm.org/doi/10.1145/255129.255155
Rego VMathur A(1990)Exploiting Parallelism Across Program ExecutionIEEE Transactions on Parallel and Distributed Systems10.1109/71.801701:4(399-414)Online publication date: 1-Oct-1990
https://dl.acm.org/doi/10.1109/71.80170
Show More Cited By

Abstract

References

Cited By

Recommendations

Experience with Multiple Processor Versions of Concurrent C

Redundant Synchronization Elimination for DOACROSS Loops

(R) Polynomial - Time Nested Loop Fusion with Full Parallelism

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations