ACM Home Page
Please provide us with feedback. Feedback
On reordering instruction streams for pipelined computers
Full text PdfPdf (757 KB)
Source International Symposium on Microarchitecture archive
Proceedings of the 22nd annual workshop on Microprogramming and microarchitecture table of contents
Dublin, Ireland
Pages: 199 - 206  
Year of Publication: 1989
ISBN:0-89791-324-8
Also published in ...
Authors
J.-J. Shieh  Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, Ohio
C. Papachristou  Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, Ohio
Sponsors
IEEE-CS : Computer Society
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 12,   Citation Count: 4
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/75362.75419
What is a DOI?

ABSTRACT

This paper describes a method to reorder the straight line instruction streams for pipelined computers which have one instruction issue unit but may contain multiple function units. The objective is to make the most efficient usage of the pipelines within the computer system. The input to the scheduler is the intermediate code of a compiler, and is represented by a data dependence graph (DDG). The scheduler is a kind of list scheduler. The data dependence and the pipeline effect of the function units within the system have been considered for finding a most suitable time slot for each node during reordering time. The scheduler has been implemented and several scientific application programs have been tested. The results show that in most of the cases the scheduler will achieve the optimal result. The average instruction issue rate is over 96%. As a comparison, the issue rate of an ordinary compiler is only 22%; and the issue rate of a compiler with the effect of pipeline but without reordering the instruction stream is about 45%.


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.

 
Aho-86
 
Arya85
Arya, S." An Optimal Instruction - Scheduling Models for Class of Vectors Processor", IEEE Transactions on Computers, V-34(11), p981-995, Nov. 1985
Ausl82
Brow84
 
Brun80
Bruno, J., Jones, J. W. and So, K.,' Deterministic Scheduling with Pipelined Processors", IEEE Transactions on Computers, C-29(4), p308 316, Apr. 1980
 
Bucy80
Bucy, R. S. and Senne, K. D.," Nonlinear Filtering Algorithms for Vector Machines,", Computers and Mathematics, V-6(3), p317-338, 1980
 
Burd85
Burden, R. L. and Faires, J. D., Numerical Analysis, Prindle, Weber and Schmidt, Boston, 1985
 
Dong79
Dongarra, J. J. and Hinds, A. R.," Unrolling Loops in TORTRAN,", Software Praticce and Experience, V-9(3), Mar. 1979
 
Elli86
Gibb86
Gonz77
 
Gros83
Gross, T. R., Code Optimization of Pipeline Constraints, Technique Report No. 255, Computer System Laboratory, Dept. of Electric Engineering and Conputer Science, Stanford University, Dec. 1983
Henn83
John86
 
Kasa84
Kasahara, H. and Narita, S.,"" Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Proccessing", IEEE Transactions on Computers, C-33(11), p1023-1029, Nov. 1984
 
Kate85
 
Kogg81
Kogge, P. M.", The Architecture of Pipelined Computers, Hemisphere Publishing Corporation, 1981
Kuck81
 
Lawl87
Lawler, E., Lenstra, J. K., Martel, C. and Simons, B.," Pipeline Scheduling: A Survey", IBM Research Report, RJ5738 (57717), July 15, 1987
Padu86
 
Poly88
Rau-81
Rau-82
Ryma82
 
Sahn84
Sahni, S.," Scheduling Multipipeline and Multiprocessor Computers', IEEE Transactions on Computers, C-30(1), p637-645, Jul. 1984
 
Shie89
Shieh, J. J. and Papachristou, C.," A Mapping Strategy for Multiprocessor Systems", To be published.
 
Thom64
Thornton, J. E.," Parallel Operation in Control Data 6600,", Proc. of Fall Joint Computer Conference, Part 2, V-26, p33-40, 1964
 
Toma67
Tomasulo, R. M., " An Efficient Algorithm for Exploiting Multiple Arithmetic Units", IBM Journal, p25-33, Jan. 1967
Wali87
 
Wedi82


Collaborative Colleagues:
J.-J. Shieh: colleagues
C. Papachristou: colleagues