Paper: Parallel loops - A test suite for parallelizing compilers: Description and example results

Authors:
Jack Dongarra;Mark Furtney;Steve Reinhardt;Jerry Russell
Affiliations:
Computer Science Department, University of Tennessee, Knoxville, TN 37996-1301, USA and Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA;Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA;Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA;Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge, TN 37831, USA
Venue:
Parallel Computing
Year:
1991

Citing 0
Cited 2

A Neural Network Based Tool for Semi-automatic Code Transformation

VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
An exact data dependence testing method for quadratic expressions

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several multiprocessor systems are now commercially available, and advances in compiler technology provide automatic conversion of programs to run on such systems. However, no accepted measure of this parallel compiler ability exists. This paper presents a test suite of subroutines and loops, called Parallel Loops, designed to (1) measure the ability of parallelizing compilers to convert code to run in parallel and (2) determine how effectiveley parallel hardware and software work together to achieve high performance across a range of problem sizes. In addition, we present the results of compiling this suite using two commercially available parallelizing Fortran compilers, Cray and Convex.