This paper presents several synthetic Fortran codes for testing the ability of automatic parallelizers to generate efficient parallel code. The codes typify sequential solution techniques currently in use at NAS and represent the types of algorithms that automatic parallelizers will be required to analyze and decompose. The Cray automatic parallelizer FPP performed well on codes containing explicitly parallel algorithms, but required user intervention to assist in vectorized relaxation schemes. The inability of FPP to expose parallelism at a level higher than loop level reduced the parallel performance of relaxation and ADI schemes. The Cray utility atexpert consistently diagnosed the causes for poorer-than-expected parallel performance. Th...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
In recent years, methods for analyzing and parallelizing sequential code using data analysis and loo...
Parallelization is a technique that boosts the performance of a program beyond optimizations of the ...
This paper will discuss one of these automatic tools that has been developed recently by Cray Resear...
This paper studies howwell automatic parallelization techniques work on a collection of real codes w...
Parallel computing is not the new kid on the block. Interest in this area exists since the developme...
This paper discusses the techniques used to hand-parallelize, for the Alliant FX/80, four Fortran pr...
We carried out a series of benchmark tests to know the ability of automatic parallelization of four ...
Characteristics of full applications found in scientific computing industries today lead to challeng...
Automatic parallelization is usually believed to be less effective at exploiting implicit parallelis...
The parallelization of real-world compute intensive Fortran application codes is generally not a tri...
The end of Dennard scaling also brought an end to frequency scaling as a means to improve performanc...
This paper describes a knowledge-based system for automatic parallelization of a wide class of seque...
This paper presents an overview of automatic program parallelization techniques. It covers dependenc...
Due to the character of the original source materials and the nature of batch digitization, quality ...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
In recent years, methods for analyzing and parallelizing sequential code using data analysis and loo...
Parallelization is a technique that boosts the performance of a program beyond optimizations of the ...
This paper will discuss one of these automatic tools that has been developed recently by Cray Resear...
This paper studies howwell automatic parallelization techniques work on a collection of real codes w...
Parallel computing is not the new kid on the block. Interest in this area exists since the developme...
This paper discusses the techniques used to hand-parallelize, for the Alliant FX/80, four Fortran pr...
We carried out a series of benchmark tests to know the ability of automatic parallelization of four ...
Characteristics of full applications found in scientific computing industries today lead to challeng...
Automatic parallelization is usually believed to be less effective at exploiting implicit parallelis...
The parallelization of real-world compute intensive Fortran application codes is generally not a tri...
The end of Dennard scaling also brought an end to frequency scaling as a means to improve performanc...
This paper describes a knowledge-based system for automatic parallelization of a wide class of seque...
This paper presents an overview of automatic program parallelization techniques. It covers dependenc...
Due to the character of the original source materials and the nature of batch digitization, quality ...
The multicore era has increased the need for highly parallel software. Since automatic parallelizati...
In recent years, methods for analyzing and parallelizing sequential code using data analysis and loo...
Parallelization is a technique that boosts the performance of a program beyond optimizations of the ...