ACM Home Page
Please provide us with feedback. Feedback
Exploiting instruction-level parallelism: the multithreaded approach
Full text PdfPdf (463 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 25th annual international symposium on Microarchitecture table of contents
Portland, Oregon, United States
Pages: 189 - 192  
Year of Publication: 1992
ISBN:0-8186-3175-9
Also published in ...
Authors
Sponsors
IEEE-CS : Computer Society
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
IEEE Computer Society Press  Los Alamitos, CA, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 13,   Citation Count: 1
Additional Information:

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/144953.145798
What is a DOI?

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
R. Govindarajan and S.S. Ncmwarkar. Small: A scalable multithreaded architecture to exploit large locality. In Proc. of the 4th IEEE Syrup. on Parallel and Distributed Processing, December 1992. to appear.
3
 
4
Mike :Johnson. Superscalar Microprocessor Design. Prentice Hall, Englewood Cliffs, New Jersey 07632, 1991.
5
 
6
Philip Lenir and Vincent Collini. A large context multithreaded architecture with multiple pipelininn. Report, McGill University, Dept. of Electrical Engineering, April 1992.
 
7
A. Nicolau and J. A. Fisher. Measuring the parallelism available for very long instruction word architectures. IEEE Transactions on Computers, 1984.
8
 
9
 
10
Burton J. Smith. Architecture and applications of the HEP multiprocessor computer system. In SPIE Real-Time Signal Processing IV, volume 298, pages 241-248, 1981.
11


Collaborative Colleagues:
Philip Lenir: colleagues
R. Govindarajan: colleagues
S. S. Nemawarkar: colleagues