ACM Home Page
Please provide us with feedback. Feedback
HPSm, a high performance restricted data flow architecture having minimal functionality
Full text PdfPdf (876 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 13th annual international symposium on Computer architecture table of contents
Tokyo, Japan
Pages: 297 - 306  
Year of Publication: 1986
ISBN:0-8186-0719-X
Also published in ...
Authors
W. Hwu  Computer Science Division, University of California, Berkeley, Berkeley, CA
Y. N. Patt  Computer Science Division, University of California, Berkeley, Berkeley, CA
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society Press  Los Alamitos, CA, USA
Bibliometrics
Downloads (6 Weeks): 156,   Downloads (12 Months): 179,   Citation Count: 34
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/17407.17391
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Arvind and Gostelow, K. P., "A New Interpreter for Dataflow and Its Implications for Computer Architecture," Department of Information and Computer Science, University of California, Irvine, Tech. Report 72, October 1975.
3
4
5
 
6
liwu, W., Melvin, S., Shebanow, M.C., Chen, C., Wei, J., and Patt, N.Y., "An lIPS Implementation of VAX; Initial Design and Analysis," Proceedings of the 19th Annual Hawaii International Conference on System Sciences, 1986.
 
7
Tomasulo, R. M., "An Efficient Algorithm for Exploiting Multiple Arithmetic Units," IBM Journal of Research and Development, vol. 11, 1967, pp 25 - 33. Principles and Examples, McGraw-Hill, 1982.
 
8
Anderson, D. W., Sparacio, F. J., Tomasulo, R. M., "The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling," IBM Journal of Research and Development, Vol. 11, No. 1, 1967, pp. 8-24.
9
 
10
Patterson, D.A. and Sequin, C.H., "A VLSI RISC," Computer, 15, 9, September, 1982, 8-21.
 
11
Shebanow, M.C., Patt, N.Y., Hwu, W., and Melvin, S., "A C Compiler for HPS I, a Highly Parallel Execution Engine," Proceedings of the 19th Annual Hawaii International Conference on System Sciences, 1986.
 
12
Hennessy, J.L., "VLSI Processor Architecture," IEEE Transaction on Computers, C-33(12), December 1984, pp1221-1246.

CITED BY  35