Data flow analysis for parallel programs

Authors:
M. Robert Ito;A. Zaafrani
Affiliations:
Department of Electrical Engineering, University of British Columbia, 2356 Main Mall, Vancouver, B.C., Canada, V6T 1Z4;Department of Electrical Engineering, University of British Columbia, 2356 Main Mall, Vancouver, B.C., Canada, V6T 1Z4
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 7
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Advanced compiler optimizations for supercomputers

Communications of the ACM - Special issue on parallelism
Efficient and correct execution of parallel programs that share memory

ACM Transactions on Programming Languages and Systems (TOPLAS)
Synchronization, Coherence, and Event Ordering in Multiprocessors

Computer
Analysis of event synchronization in a parallel programming tool

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Supporting shared data structures on distributed memory architectures

PPOPP '90 Proceedings of the second ACM SIGPLAN symposium on Principles & practice of parallel programming
Optimizing Supercompilers for Supercomputers

Optimizing Supercompilers for Supercomputers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a general approach for collecting data flow information for shared memory parallel languages. This work can be used for any language that supports concurrent execution of threads, and consumer-producer synchronization or barrier synchronization between the threads. We assume that the traditional serial data flow information for each thread is available. We build on top of that to find new techniques and equations for collecting reaching definition, available expression, and live variables sets for parallel programs.