The widespread use of object-oriented languages and Internet security concerns are just the
beginning. Add embedded systems, multiple memory banks, highly pipelined units …

The goal of languages like Fortran D or High Performance Fortran (HPF) is to provide a
simple yet efficient machine-independent parallel programming model. After the algorithm …

Performance prediction models at the source code level are crucial in optimizing compilers,
programming environments, and performance debugging tools. For each performance …

This paper presents a data layout optimization technique for sequential and parallel
programs based on the theory of hyperplanes from linear algebra. Given a program, our …

The emergence of multicore platforms offers several opportunities for boosting application
performance. These opportunities, which include parallelism and data locality benefits …

Exploiting spatial and temporal locality is essential for obtaining high performance on
modern computers. Writing programs that exhibit high locality of reference is difficult and …

This paper presents a new method that can be applied by a parallelizing compiler to find,
without user intervention, the iteration and data decompositions that minimize …

Parallel architectures with physically distributed memory provide a cost-effective scalability
to solve many large scale scientific problems. However, these systems are very difficult to …

Parallel architectures with physically distributed memory providing computing cycles and
large amounts of memory are becoming more and more common. To make such …

The actual performance of programs on modern processors that employ deep memory
hierarchies is closely related to the performance of the memory subsystem. Compiler …