Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.
Keystone Symposium

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 13 September 1991:
Vol. 253. no. 5025, pp. 1233 - 1241
DOI: 10.1126/science.253.5025.1233

Articles

Instruction-Level Parallel Processing

JOSEPH A. FISHER 1 and RAMAKRISHNA RAU 1

1 Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94303

The performance of microprocessors has increased steadily over the past 20 years at a rate of about 50% per year. This is the cumulative result of architectural improvements as well as increases in circuit speed. Moreover, this improvement has been obtained in a transparent fashion, that is, without requiring programmers to rethink their algorithms and programs, thereby enabling the tremendous proliferation of computers that we see today. To continue this performance growth, microprocessor designers have incorporated instruction-level parallelism (ILP) into new designs. ILP utilizes the parallel execution ofthe lowest level computer operations—adds, multiplies, loads, and so on—to increase performance transparently. The use of ILP promises to make possible, within the next few years, microprocessors whose performance is many times that of a CRAY-IS. This article provides an overview of ILP, with an emphasis on ILP architectures—superscalar, VLIW, and dataflow processors—and the compiler techniques necessary to make ILP work well.


THIS ARTICLE HAS BEEN CITED BY OTHER ARTICLES:
Rehosting A Mini-Computer Model On A Supercomputer.
J.W. Skiles and C.H. Schulbach (1996)
SIMULATION 66, 43-58
   Abstract »    PDF »



ADVERTISEMENT
Click Me!

ADVERTISEMENT

To Advertise     Find Products


Science. ISSN 0036-8075 (print), 1095-9203 (online)