ACM Home Page
Please provide us with feedback. Feedback
Branch folding in the CRISP microprocessor: reducing branch delay to zero
Full text PdfPdf (706 KB)
Source International Symposium on Computer Architecture archive
Proceedings of the 14th annual international symposium on Computer architecture table of contents
Pittsburgh, Pennsylvania, United States
Pages: 2 - 8  
Year of Publication: 1987
ISBN:0-8186-0776-9
Authors
D. R. Ditzel  AT&T Bell Laboratories, Murray Hill, NJ
H. R. McLellan  AT&T Bell Laboratories, Murray Hill, NJ
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 36,   Citation Count: 39
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/30350.30351
What is a DOI?

ABSTRACT

A new method of implementing branch instructions is presented. This technique has been implemented in the CRISP Microprocessor. With a combination of hardware and software techniques the execution time cost for many branches can be effectively reduced to zero. Branches are folded into other instructions, making their execution as separate instructions unnecessary. Branch Folding can reduce the apparent number of instructions needed to execute a program by the number of branches in that program, as well as reducing or eliminating pipeline breakage. Statistics are presented demonstrating the effectiveness of Branch Folding and associated techniques used in the CRISP Microprocessor.


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
A.D. Berenbaum, B. W. Colbry, D. R. Ditzel, R. D. Freeman, H. R. McLellan, K. J. O'Connor, and M. Shoji, "A Pipelined 32b Microprocessor with 13Kb of Cache Memory," Proceedings of the 1987 International Solid State Circuits Conference, pp. 34-35 (February, 1987).
2
 
3
D. Morris and R. N. Ibbet, The MU5 Computer System, Springer-Verlag (1979), p. 59.
4
5
 
6
7
8
 
9
 
10
J. L. Hennessy, N. Jouppi, F. Baskett, and J. Gill, "MIPS: A VLSI Processor Architecture," Proceedings of the CMU Conference on VLSI Systems and Computations (October 1981).
 
11
J. Moussouris, L. Crudele, D. Freitas, C. Hansen, E. Hudson, R. March, S. Przybylski, T. Riordan, C. Rowan, and D. Van't Hof, "A CMOS RISC Processor with Integrated System Functions," Spring COMPCON 1986, p. 126.
 
12
J. S. Birnbaum and W. S. Worley, "Beyond RISC: High- Precision Architecture," Spring COMPCON 1986, p. 40.
13
 
14
R. W. Holgate and R. N. Ibbet, "An Analysis of Instruction-Fetching Strategies in Pipelined Computers," IEEE Transactions on Computers C-29(4), pp. 325-329 (April 1980).
 
15
D. Morris and R. N. Ibbet, The MU5 Computer System, Springer-Verlag (1979).
 
16
D. W. Anderson, "The System/360 Model 91: Machine Philosophy and Instruction Handling," IBM Journal of Research and Development 11(8), pp. 8-24 (January 1967).
 
17
W. D. Connors, "The IBM 3033: An Inside Look," Datamation, pp. 198-218 (May 1979).
 
18
H. Schorr, "Design Principles for a High-Performance System," Proceedings of the Symposium on Computers and Automata XXI, pp. 165-192 (April, 1971).
19
 
20
J. K. F. Lee and A. J. Smith, "Branch Prediction Strategies and Branch Target Buffer Design," Computer 17(1) (January, 1984).
 
21
A. D. Berenbaum, D. R. Ditzel, and H. R. McLellan, "Introduction to the CRISP Instruction Set Architecture," Proceedings of the 1987 Spring COMPCON, pp. 86-90 (February, 1987).
 
22
23
24
 
25
 
26
J. K. F. Lee and A. J. Smith, "Branch Prediction Strategies and Branch Target Buffer Design," Computer 17(1) (January, 1984).
 
27
S. Bandyopadhyay, V. Begwani, and R. Murray, "Compiling for the CRISP Microprocessor," Proceedings of the Spring 1987 COMPCON, pp. 96-100 (February, 1987).
 
28
J. L. Hennessy and T. R. Gross, "Optimizing Branch Delays," Computer Systems Lab Technical Report, Stanford University (1981).
 
29
Peter M. Kogge, The Architecture of Pipelined Computers, McGraw-Hill (1981), pp. 237-243.
 
30
Hubert Rae McLellan, Jr., "Instruction Prefetch Strategies in a Pipelined Processor," Master of Science Thesis, Massachusetts Institute of Technology (February 1983).

CITED BY  39

Collaborative Colleagues:
D. R. Ditzel: colleagues
H. R. McLellan: colleagues