A technique for summarizing data access and its use in parallelism enhancing transformations
ACM SIGPLAN NoticesPublished 21 June 1989Open access
Vasanth Balasundaram, Ken Kennedy
Citations28
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
A in a given region R, denoted by SR(A), contains a summary of the accesses to the variable A within the region R.
Keywords
Computer Science
A framework for determining useful parallelism
67 Citations1988Frances Allen, Michael Burke +3 more
An approach to finding and forming parallel processes for both sequential and parallel programs is presented and a framework that can create useful parallelism for a variety of parallel architectures is presented.
On program restructuring, scheduling, and communication for parallel processor systems
57 Citations1986Constantine D. Polychronopoulos
This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems, with a single goal: maximizing program speedup, or equivalently, minimizing parallel execution time.