WISQ: a restartable architecture using queues

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.

REFERENCES

• Alle72: Allen, F.E., and J. Cocke, "A Catalogue of Optimizing Transformations," in Design and Optimization of Compilers, edited by R. Rustin, Prentice-Hall, 1972.
• AnST67: Anderson, D. W., F. J. Sparacio and R. M. Tomasulo, "The IBM System/360 Model 91: Machine Philosophy and Instruction" Handling," IBM Journal of Research and Development, pp. 8-24, January 1967.
• BaBM87: Bandyopadhyay, Sumit, V.S. Begwani, and R. B. Murray, "Compiling for the CRISP microprocessor," Proc. IEEE COMPCON SPRING 87, IEEE Cat. Number 87CH2409-1, pp. 96-100.
• Cout86: Coutant, D. S., C. L. Hammond, and J. W. Kelly, "Compilers for the New Generation of Hewlett-Packard Computers," Proc. "86 COMPCON, March 1986.
• Cray79: Cray Research, Inc., Cray-1 Computer Systems, Hardware Reference Manual, Chippewa Falls, Wisconsin, 1979.
• Cray82: Cray Research, Inc., CrayX-MP Series Mainframe Reference Manual, Chippewa Falls, Wisconsin, 1982.
• DiMc87: D. R. Ditzel , H. R. McLellan, Branch folding in the CRISP microprocessor: reducing branch delay to zero, Proceedings of the 14th annual international symposium on Computer architecture, p.2-8, June 02-05, 1987, Pittsburgh, Pennsylvania, United States [doi>10.1145/30350.30351]
• Ditz82: David R. Ditzel , H. R. McLellan, Register allocation for free: The C machine stack cache, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.48-56, March 01-03, 1982, Palo Alto, California, United States
• Dong79: Dongarra, J. J., and A. R. Jinds, "Unrolling Loops in Fortran", Software Practice and Experience 9, 3, pp. 219- 226, March 1979.
• Fish81: Fisher, J., "Trace Scheduling: A Technique for Global Microcode Compaction," IEEE Transactions on Computers, Vol.C-30, No. 7, July 1981.
• Flyn66: Flynn, M. J., "Very High-Speed Computing Systems," Proceedings of the IEEE, Vol. 54, No. 12, pp. 1901-1909, December 1966.
• Gibb86: Philip B. Gibbons , Steven S. Muchnick, Efficient instruction scheduling for a pipelined architecture, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.11-16, June 25-27, 1986, Palo Alto, California, United States
• GoPl85: J. R. Goodman , Jian-tu Hsieh , Koujuch Liou , Andrew R. Pleszkun , P. B. Schechter , Honesty C. Young, PIPE: a VLSI decoupled architecture, Proceedings of the 12th annual international symposium on Computer architecture, p.20-27, June 17-19, 1985, Boston, Massachusetts, United States
• Good86: J. R. Goodman , W. C. Hsu, On the use of registers vs. cache to minimize memory traffic, Proceedings of the 13th annual international symposium on Computer architecture, p.375-383, June 02-05, 1986, Tokyo, Japan
• Good87: Goodman, J. R., and Wei C. Hsu "A Code Scheduling Technique for Large Basic Blocks," In Preparation.
• Henn82: John Hennessy , Norman Jouppi , Forest Baskett , Thomas Gross , John Gill, Hardware/software tradeoffs for increased performance, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.2-11, March 01-03, 1982, Palo Alto, California, United States
• Henn83: John L. Hennessy , Thomas Gross, Postpass Code Optimization of Pipeline Constraints, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.3, p.422-448, July 1983 [doi>10.1145/2166.357217]
• Henn84: Hennessy, J. L., "VLSI Processor Architecture," 1EEE Transactions on Computers, Vol.c-33 No. 12, Dec., 1984.
• HsuP86: P Y Hsu, Highly concurrent scalar processing, University of Illinois, Department of Computer Science, Urbana, IL, 1986
• HsuW87: Wei-Chung Hsu, Register allocation and code scheduling for load/store architectures, 1987
• Hwan84: Kai Hwang , Faye A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, Inc., New York, NY, 1990
• MacL84: M. Donald MacLaren, Inline routines in VAXELN Pascal, Proceedings of the 1984 SIGPLAN symposium on Compiler construction, p.266-275, June 17-22, 1984, Montreal, Canada
• McFa86: S. McFarling , J. Hennesey, Reducing the cost of branches, Proceedings of the 13th annual international symposium on Computer architecture, p.396-403, June 02-05, 1986, Tokyo, Japan
• PaSe81: David A. Patterson , Carlo H. Sequin, RISC I: A Reduced Instruction Set VLSI Computer, Proceedings of the 8th annual symposium on Computer Architecture, p.443-457, May 12-14, 1981, Minneapolis, Minnesota, United States
• Patt82: Patterson, D. A., and C. H. Sequin, "A VLSI RISC," IEEE Computer, 15, 9, pp.8-21, Sep., 1982.
• Radi82: George Radin, The 801 minicomputer, Proceedings of the first international symposium on Architectural support for programming languages and operating systems, p.39-47, March 01-03, 1982, Palo Alto, California, United States
• Sche77: Robert W. Scheifler, An analysis of inline substitution for a structured programming language, Communications of the ACM, v.20 n.9, p.647-654, Sept. 1977 [doi>10.1145/359810.359830]
• SmPl85: James E. Smith , Andrew R. Pleszkun, Implementation of precise interrupts in pipelined processors, Proceedings of the 12th annual international symposium on Computer architecture, p.36-44, June 17-19, 1985, Boston, Massachusetts, United States
• Wall86: David W. Wall, Global register allocation at link time, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.264-275, June 25-27, 1986, Palo Alto, California, United States
• DEC85: Digital Technical Journal, Digital Equipment Corp. Hudson, MA, August 1985.
• Wulf75: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975
• Youn85: Young, H., "Evaluation of a Decoupled Computer Architecture and the Design" of A Vector Extension," Computer Sciences Technical Report #603, July, 1985.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.1 PROCESSOR ARCHITECTURES

Additional Classification:
  C. Computer Systems Organization

General Terms:
Design, Measurement, Performance