HPSm, a high performance restricted data flow architecture having minimal functionality
Authors:
Open Access
- 1 May 1986
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGARCH Computer Architecture News
- Vol. 14 (2) , 297-306
Abstract
Our recent work in microarchitecture has identified a new model of execution, restricted data flow, in which data flow techniques are used to coordinate out-of-order execution of sequential instruction streams. We believe that the restricted data flow model has great potential for implementing very high performance computing engines. This paper defines a minimal functionality variant of our model, which we are calling HPSm. The instruction set, data path, timing and control of HPSm are all described. A simulator for HPSm has been written, and some of the Berkeley RISC benchmarks have been executed on the simulator. We report the measurements obtained from these benchmarks, along with the measurements obtained for the Berkeley RISC II. The results are encouraging.Keywords
This publication has 9 references indexed in Scilit:
- HPS, a new microarchitecture: rationale and introduction1985
- Critical issues regarding HPS, a high performance microarchitecture1985
- VLSI Processor ArchitectureIEEE Transactions on Computers, 1984
- A VLSI RISCComputer, 1982
- Dependence graphs and compiler optimizations1981
- Look-Ahead ProcessorsACM Computing Surveys, 1975
- A preliminary architecture for a basic data-flow processor1975
- The IBM System/360 Model 91: Machine Philosophy and Instruction-HandlingIBM Journal of Research and Development, 1967
- An Efficient Algorithm for Exploiting Multiple Arithmetic UnitsIBM Journal of Research and Development, 1967