Dynamic Data Partitioning for Distributed-Memory Multicomputers

TL;DR: This paper provides an overview of compilation techniques for distributed memory machines that must perform partitioning of both code and data for parallel execution and discusses the relationship between the nature of compiler support and type of processor architecture.

TL;DR: This paper proposes a framework to optimize the array redistribution algorithm both in index computation and inter-processor communication, and presents an efficient index computation method and a schedule that minimizes the number of communication steps and eliminates node contention in each communication step.

TL;DR: This paper proposes an efficient scheduling scheme that not only minimizes the number of communication steps and eliminates node contention, but also minimized the difference of message lengths in each communication step and reduces the communication idle time in redistribution routines.

TL;DR: This paper presents a bounded incremental algorithm for accurate and fast 3-D extraction in such a design environment, based on the Boundary Element Method (BEM), and shows that the incremental algorithm is efficient for the iterative design methodology.

TL;DR: In this paper, two simple numerical models of the shallow-water equations identical in all respects but for their conservation properties have been tested regarding their internal mixing processes, showing that violation of enstrophy conservation results in a spurious accumulation of rotational energy in the smaller scales, reflected by an unrealistic increase of enstroke, which ultimately produces a finite rate of energy dissipation in the zero viscosity limit, thus violating the well-known dynamics of two-dimensional flow.

TL;DR: A compiler algorithm that automatically finds computation and data decompositions that optimize both parallelism and locality that is designed for use with both distributed and shared address space machines.

TL;DR: Parafrase-2 as mentioned in this paper is a vectorizing/parallelizing compiler implemented as a source to source code restructurer. Specific topics discussed are dependence analysis, timing and overhead analysis, interprocedural analysis, automatic scheduling and the graphical user interface.

TL;DR: This work discusses techniques for automatic layout of arrays in a compiler targeted to SIMD architectures, such as the Connection Machine computer system, and attempts to minimize the cost of moving data among processors.