Article

Static Analysis of Barrier Synchronization in Explicitly Parallel Programs

Authors:

Tor E. Jeremiassen,

Susan J. EggersAuthors Info & Claims

PACT '94: Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques

Pages 171 - 180

Published: 24 August 1994 Publication History

Abstract

No abstract available.

References

[1]

A. Agarwal and A. Gupta. Memory-reference characteristics of multiprocessor applications under mach. In SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 215--225, May 1988.

Digital Library

Google Scholar

[2]

A. V. Aho, R. Sethi, and J. D. Ullman. Compilers Principles, Techniques, and Tools. Addison-Wesley Publishing Company, 1988.

Digital Library

Google Scholar

[3]

C. J. Beckmann and C. D. Polychronopoulos. The effect of barrier syncrhonization and scheduling overhead on parallel loops. In International Conference on Parallel Processing, volume II, pages 200--204, August 1989.

Google Scholar

[4]

D. Callahan and K. Kennedy. Analysis of interprocedural side effects in a parallel programming environment. Journal of Parallel and Distributed Computing, (5):517--550, 1988.

Digital Library

Google Scholar

[5]

D. Callahan, K. Kennedy, and J. Subhlok. Analysis of Event Synchronization in a Parallel Programming Tool. In Second ACM SIGPLAN Symposium on Principles &amp; Practice of Parallel Programming, pages 21--30, March 1990.

Digital Library

Google Scholar

[6]

F. J. Carrasco. A parallel maxflow implementation. CS411 Project Report, Stanford University, March 1988.

Google Scholar

[7]

K. D. Cooper and K. Kennedy. Interprocedural side-effect analysis in linear time. In Conference on Programming Languages Design and Implementation, pages 57--66, June 1988.

Digital Library

Google Scholar

[8]

S. Devadas and A. R. Newton. Topological optimization of multiple level array logic. In IEEE Transactions on Computer-Aided Design, November 1987.

Digital Library

Google Scholar

[9]

J. A. Dykstal and T. C. Mowry. MINCUT: Graph partitioning using parallel simulated annealing. CS411 Project Report, Stanford University, March 1989.

Google Scholar

[10]

S. J. Eggers and T. E. Jeremiassen. Eliminating false sharing. In International Conference on Parallel Processing, volume I, pages 377--381, August 1991.

Google Scholar

[11]

P. Havlak and K. Kennedy. An implementation of interprocedural bounded regular section analysis. IEEE Transactions on Parallel and Distributed Systems, 2(3), July 1991.

Digital Library

Google Scholar

[12]

D. P. Helmbold and C. E. McDowell. Computing reachable states of parallel programs. In Proceedings of the ACM/ONR Workshop on Parallel and Distributed Debugging, pages 76--84, May 1991.

Digital Library

Google Scholar

[13]

T. E. Jeremiassen and S. J. Eggers. Computing per-process summary side-effect information. In U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua, editors, Fifth Workshop on Languages and Compilers for Parallelism, August 1992.

Digital Library

Google Scholar

[14]

J. Kam and J. Ullman. Global data flow analysis and iterative algorithms. JACM, 23(1):159--171, January 1976.

Digital Library

Google Scholar

[15]

Kendall Square Research. KSR-1 Principles of Operation, 1992.

Google Scholar

[16]

S. P. Masticola and B. G. Ryder. Non-concurrency analysis. In Fourth ACM SIGPLAN Symposium on Principles &amp; Practice of Parallel Programming, pages 129--138, May 1993.

Digital Library

Google Scholar

[17]

C. E. McDowell. A Practical Algorithm for Static Analysis of Parallel Programs. Journal of Parallel and Distributed Computing, 6:515--536, June 1989.

Digital Library

Google Scholar

[18]

E. Myers. A precise inter-procedural data flow algorithm. In Symposium on Principles of Programming Languages, pages 219--230, January 1981.

Digital Library

Google Scholar

[19]

C. Polychronopoulos, M. Girkar, M. Haghighat, C. L. Lee, B. Leung, and D. Schouten. Parafrase-2: An environment for parallelizing, partitioning, synchronizing, and scheduling programs on multi-processors. In International Conference on Parallel Processing, volume II, pages 39--48, August 1989.

Digital Library

Google Scholar

[20]

J. P. Singh, W. Weber, and A. Gupta. SPLASH: Stanford Parallel Applications for Shared-Memory. Technical Report CSL-TR-91-469, Computer Systems Laboratory, Stanford University, 1991.

Digital Library

Google Scholar

[21]

R. N. Taylor. A general-purpose algorithm for analyzing concurrent programs. Communications of the ACM, 26(5):362--376, 1983.

Digital Library

Google Scholar

[22]

J. Torrellas, M. S. Lam, and J. L. Hennessy. Shared data placement optimizations to reduce multiprocessor cache miss rates. In Proceedings of the 1990 International Conference on Parallel Processing, volume II, pages 266--270, August 1990.

Google Scholar

[23]

D. W. Wall. Predicting program behavior using real or esitmated profiles. In Conference on Programming Language Design and Implementation, pages 59--70, June 1991.

Digital Library

Google Scholar

Cited By

View all

Dabrowski FHaddad HWainwright RChbeir R(2018)Textual alignment in SPMD programsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167254(1046-1053)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167254
Chabbi MLavrijsen Wde Jong WSen KMellor-Crummey JIancu C(2015)Barrier elision for production parallel programsACM SIGPLAN Notices10.1145/2858788.268850250:8(109-119)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2858788.2688502
Chabbi MLavrijsen Wde Jong WSen KMellor-Crummey JIancu CCohen AGrove D(2015)Barrier elision for production parallel programsProceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/2688500.2688502(109-119)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2688500.2688502
Show More Cited By

Static Analysis of Barrier Synchronization in Explicitly Parallel Programs
1. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

Static Barrier MIMD

In this paper, we describe and analyze the performance of a new architectural construct - an efficient synchronization mechanism called "Static Barrier MIMD" or SBM. Unlike traditional barrier synchronization, the proposed barriers are designed to allow ...
Parallel Data-Flow Analysis of Explicitly Parallel Programs
Euro-Par '99: Proceedings of the 5th International Euro-Par Conference on Parallel Processing

In terms of program verification data-flow analysis (DFA) is commonly understood as the computation of the strongest postcondition for every program point with respect to a precondition which is assured to be valid at the entry of the program. Here, we ...
Distributed Hardwired Barrier Synchronization for Scalable Multiprocessor Clusters

Conventional multiprocessors mostly use centralized, memory-based barriers to synchronize concurrent processes created in multiple processors. These centralized barriers often become the bottleneck or hot spots in the shared memory. In this paper, we ...

Comments

Information & Contributors

Information

Published In

PACT '94: Proceedings of the IFIP WG10.3 Working Conference on Parallel Architectures and Compilation Techniques

August 1994

342 pages

ISBN:0444819266

Publisher

North-Holland Publishing Co.

Netherlands

Publication History

Published: 24 August 1994

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 121 of 471 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
0
Total Downloads

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

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dabrowski FHaddad HWainwright RChbeir R(2018)Textual alignment in SPMD programsProceedings of the 33rd Annual ACM Symposium on Applied Computing10.1145/3167132.3167254(1046-1053)Online publication date: 9-Apr-2018
https://dl.acm.org/doi/10.1145/3167132.3167254
Chabbi MLavrijsen Wde Jong WSen KMellor-Crummey JIancu C(2015)Barrier elision for production parallel programsACM SIGPLAN Notices10.1145/2858788.268850250:8(109-119)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2858788.2688502
Chabbi MLavrijsen Wde Jong WSen KMellor-Crummey JIancu CCohen AGrove D(2015)Barrier elision for production parallel programsProceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming10.1145/2688500.2688502(109-119)Online publication date: 24-Jan-2015
https://dl.acm.org/doi/10.1145/2688500.2688502
Kempf SVeldema RPhilippsen M(2013)Compiler-Guided identification of critical sections in parallel codeProceedings of the 22nd international conference on Compiler Construction10.1007/978-3-642-37051-9_11(204-223)Online publication date: 16-Mar-2013
https://dl.acm.org/doi/10.1007/978-3-642-37051-9_11
Bronevetsky G(2009)Communication-Sensitive Static Dataflow for Parallel Message Passing ApplicationsProceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization10.1109/CGO.2009.32(1-12)Online publication date: 22-Mar-2009
https://dl.acm.org/doi/10.1109/CGO.2009.32
Kamil AYelick K(2009)Enforcing textual alignment of collectives using dynamic checksProceedings of the 22nd international conference on Languages and Compilers for Parallel Computing10.1007/978-3-642-13374-9_25(368-382)Online publication date: 8-Oct-2009
https://dl.acm.org/doi/10.1007/978-3-642-13374-9_25
Zhang YDuesterwald EYelick KMellor-Crummey J(2007)Barrier matching for programs with textually unaligned barriersProceedings of the 12th ACM SIGPLAN symposium on Principles and practice of parallel programming10.1145/1229428.1229472(194-204)Online publication date: 14-Mar-2007
https://dl.acm.org/doi/10.1145/1229428.1229472
Lin Y(2005)Static nonconcurrency analysis of OpenMP programsProceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming10.5555/1892830.1892835(36-50)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.5555/1892830.1892835
Kamil ASu JYelick KKramer W(2005)Making Sequential Consistency Practical in TitaniumProceedings of the 2005 ACM/IEEE conference on Supercomputing10.1109/SC.2005.43Online publication date: 12-Nov-2005
https://dl.acm.org/doi/10.1109/SC.2005.43
Kamil AYelick K(2005)Concurrency analysis for parallel programs with textually aligned barriersProceedings of the 18th international conference on Languages and Compilers for Parallel Computing10.1007/978-3-540-69330-7_13(185-199)Online publication date: 20-Oct-2005
https://dl.acm.org/doi/10.1007/978-3-540-69330-7_13
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Static Barrier MIMD

Parallel Data-Flow Analysis of Explicitly Parallel Programs

Distributed Hardwired Barrier Synchronization for Scalable Multiprocessor Clusters

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations