A technique for summarizing data access and its use in parallelism enhancing transformations

Published 21 June 1989

Vasanth Balasundaram, Ken Kennedy

Citations129

TL;DR

A technique for summarizing the data accesses in a given region is presented and it is shown how this summary can be used to detect and enhance task parallelism in a program.

Abstract

article A technique for summarizing data access and its use in parallelism enhancing transformations Share on Authors: V. Balasundaram Dept. of Computer Science, Rice University Dept. of Computer Science, Rice UniversityView Profile , K. Kennedy Dept. of Computer Science, Rice University Dept. of Computer Science, Rice UniversityView Profile Authors Info & Claims ACM SIGPLAN NoticesVolume 24Issue 7July 1989 pp 41–53https://doi.org/10.1145/74818.74822Published:21 June 1989 104citation512DownloadsMetricsTotal Citations104Total Downloads512Last 12 Months15Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer Science

Optimizing supercompilers for supercomputers

837 Citations2020Michael Wolfe

This work will focus a great deal on the importance of compilers in supercomputing, and compare and contrast the advantages and impacts of compiler solutions to the "Performance + Portability + Productivity" problem with language and runtime solutions.

Kluwer international series in engineering and computer scienceDependence Analysis for Supercomputing

599 Citations1988Utpal Banerjee

This chapter discusses one-Dimensional Arrays, Single Loops, and Dependence Tests, which are tests of the theory of Dependence on Vectors and its application to Systems of Equations.

ACM SIGPLAN NoticesInterprocedural dependence analysis and parallelization

219 Citations2004Michael Burke, Ron K. Cytron

A method is presented that combines a deep analysis of program dependences with a broad analysis of the interaction among procedures, and a unified approach that integrates subscript analysis with aliasing and interprocedural information is presented.

Rice University's digital scholarship archive (Rice University)PFC: A Program to Convert Fortran to Parallel Form

196 Citations1982John R. Allen, Ken Kennedy

View PDF

Analysis of interprocedural side effects in a parallel programming environment

127 Citations2014David Callahan, Ken Kennedy

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.

View PDF