Automatic detection of nondeterminacy in parallel programs-Reference-Cited by-同舟云学术

Automatic detection of nondeterminacy in parallel programs

Published:1989-01-03 Issue:1 Volume:24 Page:89-99
ISSN:0362-1340
Container-title:ACM SIGPLAN Notices
language:en
Short-container-title:SIGPLAN Not.

Author:

Emrath Perry A.¹,Padua David A.²

Affiliation:

1. Univ. of Illinois at Urbana-Champaign, Urbana

2. Univ. of Illinois at Urbana-Cahmpaign, Urbana

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Reference11 articles.

1. Alliant Computer Systems Corporation FX/FOR TRAN Language Manual Littleton~ MA May 1987. Alliant Computer Systems Corporation FX/FOR TRAN Language Manual Littleton~ MA May 1987.

2. Banerjee U. Dependence Analysis for Super~omputing forthcoming Kluwer Academic Publishers Boston 1988. Banerjee U. Dependence Analysis for Super~omputing forthcoming Kluwer Academic Publishers Boston 1988.

3. Guarna V. A. Malony A. D. and Reed D. A. and Cannon D.B. "The Design of a Parallel Programming Environment " Center for Supercomputlng Research and Development University of Illinois at Urbana- Champaign Report No. 770 1988. Guarna V. A. Malony A. D. and Reed D. A. and Cannon D.B. "The Design of a Parallel Programming Environment " Center for Supercomputlng Research and Development University of Illinois at Urbana- Champaign Report No. 770 1988.

4. Kuck D. J. Davidson E. S. Lawrie D. H. and Sameh A. H. "Parallel Supercomputing Today and the Cedar Approach" Science ~31 4740 (Feb. 28 198{}) 967-974. Kuck D. J. Davidson E. S. Lawrie D. H. and Sameh A. H. "Parallel Supercomputing Today and the Cedar Approach" Science ~31 4740 (Feb. 28 198{}) 967-974.

Cited by 28 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The usage of cybernetic in complex software systems and its application to the deterministic multithreading;Concurrency and Computation: Practice and Experience;2022-10-31

2. Conclusion and Future Work;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09

3. Parallel Cartesian Tree and Suffix Tree Construction;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09

4. Parallel and Cache-Oblivious Triangle Computations;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09

5. Linear-Work Parallel Graph Connectivity;Shared-Memory Parallelism Can Be Simple, Fast, and Scalable;2017-06-09