A new set of benchmarks has been developed for the performance evaluation of highly
parallel supercom puters. These consist of five" parallel kernel" bench marks and three" …

A new set of benchmarks has been developed for the performance evaluation of highly
parallel supercomputers. These benchmarks consist of five 'parallel kernel” benchmarks and …

Loop fusion is a program transformation that merges multiple loops into one. It is effective for
reducing the synchronization overhead of parallel loops and for improving data locality. This …

Scheduling algorithms that use application and system knowledge have been shown to be
more effective at scheduling parallel jobs on a multiprocessor than algorithms that do not …

Precise and efficient dependence tests are essential to theeffectivermss ofaparallelizing
compiler. This paper proposes a dependence testing scheme based on classifyingpairs …

Standard benchmarking provides to run-times for given programs on given machines, but
fails to provide insight as to why those results were obtained (either in terms of machine or …

Floating-point division is generally regarded as a low frequency, high latency operation in
typical floating-point applications. However, in the worst case, a high latency hardware …

Optimizing compilers should produce e cient code even in the presence of high-level
language constructs. However, current programming support systems are signi cantly …

Previous research has used program transformation to introduce parallelism and to exploit
data locality. Unfortunately, these two objectives have usually been considered …

In this paper, we present a GSA-based technique that performs more efficient and more
precise symbolic analysis of predicated assignments, recurrences and index arrays. The …