WISQ: a restartable architecture using queues

  • Authors:

  • A. R. Pleszkun;J. R. Goodman;W. C. Hsu;R. T. Joersz;G. Bier;P. Woest;P. B. Schechter

  • Affiliations:

  • Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI;Computer Sciences Department, Electrical and Computer Engineering Department, University of Wisconsin-Madison, WI

  • Venue:
  • ISCA '87 Proceedings of the 14th annual international symposium on Computer architecture
  • Year:
  • 1987

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, the WISQ architecture is described. This architecture is designed to achieve high performance by exploiting new compiler technology and using a highly segmented pipeline. By having a highly segmented pipeline, a very-high-speed clock can be used. Since a highly segmented pipeline will require relatively long pipelines, a way must be provided to minimize the effects of pipeline bubbles that are formed due to data and control dependencies. It is also important to provide a way of supporting precise interrupts. These goals are met, in part, by providing a reorder buffer to help restore the machine to a precise state. The architecture then makes the pipelining visible to the programmer/compiler by making the reorder buffer accessible and by explicitly providing that issued instructions cannot be affected by immediately preceding ones. Compiler techniques have been identified that can take advantage of the reorder buffer and permit a sustained execution rate approaching or exceeding one per clock. These techniques include using trace scheduling and providing a relatively easy way to “undo” instructions if the predicted branch path is not taken. We have also studied ways to further reduce the effects of branches by not having them executed in the execution unit. In particular, branches are detected and resolved in the instruction fetch unit. Using this approach, the execution unit is sent a stream of instructions (without branches) that are guaranteed to execute.