Journal Article10.1016/0096-0551(94)90001-9
An automatic parallelization framework for multicomputers
5
TL;DR: A scheme of automatic data partitioning and dynamic data distribution of sequential programs for multicomputer architecture is proposed and tiling transformation for iteration space partitioning is resort to.
read more
About: This article is published in Computer Languages. The article was published on 01 Aug 1994. The article focuses on the topics: Automatic parallelization & Transputer.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Enhancing the Role of Inlining in Effective Interprocedural Parallelization
Jichi Guo,Mike Stiles,Qing Yi,Kleanthis Psarris +3 more
- 13 Sep 2011
TL;DR: The experimental results show that the annotation-based in lining approach can eliminate negative impact of conventional in lining while enhancing the effectiveness of interprocedural parallelization for a majority of applications from the PERFECT benchmark suite.
An automatic parallelization framework for multicomputers
TL;DR: A scheme of automatic data partitioning and dynamic data distribution of sequential programs for multicomputer architecture is proposed and tiling transformation for iteration space partitioning is resort to.
5
Precise analysis of array usage in scientific programs
M. Manjunathaiah,Denis A. Nicole +1 more
TL;DR: This article presents a generalized technique to precisely compute Union which can overcome imprecision in the analyses and the imprecisions resulting from successive operations have a cumulative effect.
Enhancing the Effectiveness of Inlining in Automatic Parallelization
TL;DR: The experimental results show that the annotation-based inlining approach can eliminate negative impact of conventional inlining while enhancing the effectiveness of interprocedural parallelization for a majority of applications from the PERFECT benchmark suite.
References
Compiling communication-efficient programs for massively parallel machines
Jingke Li,M. Chen +1 more
TL;DR: A method of generating parallel target code with explicit communication for massively parallel distributed-memory machines is presented and an explicit communication metric is used to guide the selection of data layout strategies.
203
A methodology for high-level synthesis of communication on multicomputers
Manish Gupta,Prithviraj Banerjee +1 more
- 01 Aug 1992
TL;DR: This paper presents a methodology for determining the collective communication primitives that should be used for implementing the data movement at various points in the program, and introduces the notion of certain synchronous properties between array references in statements inside loops.
39
An automatic parallelization framework for multicomputers
TL;DR: A scheme of automatic data partitioning and dynamic data distribution of sequential programs for multicomputer architecture is proposed and tiling transformation for iteration space partitioning is resort to.
5
Compile-time techniques for data distribution in distributed memory machines
J. Ramanujam,P. Sadayappan +1 more
TL;DR: A solution to the problem of partitioning data for distributed memory machines using a matrix notation to describe array accesses in fully parallel loops that allows the derivation of sufficient conditions for communication-free partitioning (decomposition) of arrays.
•Book
Dependence analysis for supercomputing
Utpal Banerjee
- 01 Jan 1988
TL;DR: 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.