Parallel processing: a smart compiler and a dumb machine

Authors:
Joseph A. Fisher;John R. Ellis;John C. Ruttenberg;Alexandru Nicolau
Affiliations:
Yale University, New Haven, CT;Yale University, New Haven, CT;Yale University, New Haven, CT;Yale University, New Haven, CT
Venue:
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Year:
2004

Citing 7
Cited 0

Compiler construction: theory and practice (2nd ed.)

Compiler construction: theory and practice (2nd ed.)
Postpass Code Optimization of Pipeline Constraints

ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer Methods for Mathematical Computations

Computer Methods for Mathematical Computations
Very Long Instruction Word architectures and the ELI-512

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture
Using an oracle to measure potential parallelism in single instruction stream programs

MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
Parallelism, memory anti-aliasing and correctness for trace scheduling compilers (disambiguation, flow-analysis, compaction)

Parallelism, memory anti-aliasing and correctness for trace scheduling compilers (disambiguation, flow-analysis, compaction)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Principles of Compiler Design (Addison-Wesley series in computer science and information processing)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Multiprocessors and vector machines, the only successful parallel architectures, have coarse-grained parallelism that is hard for compilers to take advantage of. We've developed a new fine-grained parallel architecture and a compiler that together offer order-of-magnitude speedups for ordinary scientific code.