We present new techniques for compilation of arbitrarily nested loops with affine
dependences for distributed-memory parallel architectures. Our framework is implemented …

Applications often involve iterative execution of identical or slowly evolving calculations.
Such applications require incremental rebalancing to improve load balance across …

Many recent multicore multiprocessors are based on a nonuniform memory architecture
(NUMA). A mismatch between the data access patterns of programs and the map** of …

This paper introduces user-defined domain maps, a novel concept for implementing
distributions and memory layouts for parallel data aggregates. Our domain maps implement …

(57) ABSTRACT A method and system for processing generic formatted data, including first
data describing a sequence of generic opera tions without any loops, in view of providing …

A key characteristic of today's high performance computing systems is a physically
distributed memory, which makes the efficient management of locality essential for taking …

A parallel algorithm designed for widely used distributed computer clusters is developed for
the real-space self-consistent-field theory for polymers. We adopt an efficient data partition …

Compiling for distributed-memory parallel architectures is considered very challenging. In
spite of the large amount of work done to address this problem, no practical and efficient …

This paper proposes techniques for data allocation and computation map** when
compiling affine loop nest sequences for distributed-memory clusters. Techniques for …

Loops are the main source of parallelism in many applications. This paper solves the open
problem of extracting the maximal number of iterations from a loop to run parallel on chip …