Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Steven Heller

dblp:94/2102 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
High-performance computing · 67% Parallel and multicore computing · 33%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Compilers and program optimization
loop optimization
0.011991
Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler · PLDI 1991
Compilers and program optimization › loop transformation
loop unrolling
0.011991
Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler · PLDI 1991
Parallel and multicore computing
data-parallel programming
0.011991
Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler · PLDI 1991
High-performance computing
scientific computing systems
0.011991
Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler · PLDI 1991
High-performance computing
stencil computation
0.011991
Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler · PLDI 1991

Methods — techniques the papers use, named apart from their topics

strip-mining · 0.0microcode generation · 0.0chained multiply-add · 0.0
YearPublicationVenuePosition
1991 Fortran at Ten Gigaflops: The Connection Machine Convolution Compiler
abstract
We have implemented a prototype of a specialized compiler module and associated run-time support that allows a Fortran user to achieve sustained floatingpoint performance of over 10 gigaflops on the Connection Machine Model CM-2.This improves substantially over the previous record of 5.6 gigaflops, which was achieved by means of hand-crafted low-level coding techniques (on which this work has been based).Indeed, the same code that ran at 5.6 gigaflops in 1989 now runs at over 14 gigaflops.The compiler module processes array assignment statements of a certain form the right-hand side must be a sum of products and the products must use the Fortran 90 array-shifting intrinsic in a certain stylized pattern.Such assignment statements are suitable for expressing array convolution (stencil) computations and can be executed efficiently by chained multiplyadd operations.Our implementation strategy divides responsibility for the computation into four parts.A run-time library provides the outer loop structure for strip-mining and for handling multidimensional arrays.Anew primitive speeds up nearest-neighbor grid communication.Hand-written CM-2 sequencer microcode directs the pipelined execution of the floating-point units.The compiler module performs a kind of loop unrolling in order to optimize the use of registers and determines, at compile time, the microcode to be used at run time.
Mark Bromley, Steven Heller, Timothy S. McNerney, Guy L. Steele Jr.
PLDI2