Branch Prediction Strategies and Branch Target Buffer Design

Computer

Volumn 17, Issue 1, 1984, Pages 6-22

  Lee, Johny K F ^a   Packard, Hewlett ^a   Smith, Alan Jay ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH TARGET BUFFER DESIGN; CENTRAL PROCESSING UNIT;

COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

COMPUTER ARCHITECTURE;

EID: 0021204160     PISSN: 00189162     EISSN: None     Source Type: Trade Journal    
DOI: 10.1109/MC.1984.1658927     Document Type: Article

References (37)

1. C. V. Ramamoorthy and H. F. Li, “Pipeline Architecture,” Computing Surveys, Vol. 9, No. 1, Mar. 1977, pp. 61–-102.
2. A. J. Smith, “Cache Memories,” Computing Surveys, Vol. 14, No. 3, Sept., 1982, pp. 473–530.
3. STAR-100 Hardware Reference Manual 60256000, Control Data Corporation, Arden Hills, Minn., 1975.
4. J. E. Thornton, “Parallel Operation in the Control Data 6600,” AFIPS Conf. Proc., Vol. 26, part I, 1964 FJCC, pp. 33–40.
5. Control Data 7600 Hardware Reference Manual 60367200, Control Data, Arden Hills, Minn., 1975.
6. R. M. Russell, “The Cray-1 Computer System,” Comm. ACM, Vol. 21, No. 1, Jan. 1978, pp. 63–72.
7. F. C. Garcia and T. Huynh, “Storage Fetch Contention Reduction by Using Instruction Branch Prediction,” IBM Technical Disclosure Bull., Vol. 23, No. 6, 1980, pp. 2404–2405.
8. E. M. Riseman and C. C. Foster, “The Inhibition of Potential Parallelism by Conditional Jumps,” IEEE Trans. Computers, Vol. C-2U No. 12, Dec. 1972, pp. 1405–1411.
9. IBM Maintenance Library System/370 Model 168 Theory of Operation/Diagrams Manual, Vol. 2, 1973, IBM, Poughkeepsie, N.Y.
10. IBM Maintenance Library 3033 Processor Complex Theory of Operation/Diagrams Manual, Vols. 1–3, Jan. 1978, IBM, Poughkeepsie, N.Y.
11. J. F. Hughes, “Branch on Condition Decoding With Instruction Queues Empty,” IBM Technical Disclosure Bull., Vol. 24, No. 4, 1981, pp. 1857–1858.
12. J. Y. Yamour, “Instruction Scan for an Early Resolution of a Branch Instruction,” IBM Technical Disclosure Bull., Vol. 23, No. 6, Nov. 1980, pp. 2600–2604.
13. D. W. Anderson, F. J. Sparacio, and R. M. Tomasulo, “The Model 91: Machine Philosophy and Instruction Handling,” IBM J. Research and Development, Vol. 11, Jan. 1967, pp. 8–24.
14. Amdahl 470 V/6 Machine Reference Manual, Amdahl, Sunnyvale, Calif., 1976.
15. The ACS System Central Processor, manual 929982–11, Texas Instruments, Dec. 1976.
16. George Radin, “The 801 Minicomputer,” Proc. Symp. Architectural Support for Programming Languages and Operating Systems, Mar. 1982, pp. 39–47. (also available as Sigarch Computer Architecture News, Vol. 10, No. 2, Mar. 1982, and as IBM Research tech, report RC 9125, Nov. 1981).
17. E. R. Berlekamp, presentation at CS Division Seminar, UC Berkeley, 1979.
18. D. A. Patterson and H. Sequin, “RISC-1: A Reduced Instruction Set VLSI Computer,” Proc. Eighth Symp. Computer Architecture, May 1981, pp. 443–458.
19. C. Widdoes, Jr. Jump Prediction, Feb. 1977, unpublished draft.
20. B. T. Hailpern and B. L. Hitson, S-1 Architecture Manual, Stanford University, Computer Systems Laboratory tech, report STAN-CS-79-715, Stanford, Calif., Jan. 1979.
21. A. G. Liles, Jr., and B. E. Willner, “Branch Prediction Mechanism,” IBM Technical Disclosure Bull., Vol. 22, No. 7, 1979, pp. 3013–3016.
22. G. S. Rao, “Technique for Minimizing Branch Delay Due to Incorrect Branch History Table Predictions,” IBM Technical Disclosure Bull., Vol. 25, No. 1, June 1982, pp. 97–98.
23. R. W. Holgate and R. N. Ibbett, “An Analysis of Instruction Fetching Strategies in Pipelined Computers,” IEEE Trans. Computers, Vol. C-29, No. 4, Apr. 1980, pp. 325–329.
24. J. J. Losq, “Generalized History Table for Branch Prediction,” IBM Technical Disclosure Bull., Vol. 25, No. 1, June 1982, pp. 99–101.
25. J. E. Smith, “A Study of Branch Prediction Strategies,” Proc. Eighth Symp. Computer Architecture, May 1981, pp. 135–148 (also available as Sigarch Newsletter, Vol. 9, No. 3, 1981).
26. A.I. Smith. “Bibliography on Paging and Related Iopies,” Operating Systems Review, Vol. 12. No. 4. Oct. 1978 pp. 39–56.
27. J. R. Spirn Program Behavior: Models and Measurements, Elsevier, New York, 1977.
28. J. M. Angiulli et al, “Branch Direction Prediction Mechanism.” IBM Technical Diselosure Bull., vol. 23, No. 1, June 1980, pp. 268–269.
29. II. Pomerene and R. N. Reehtesehatten. “Dynamic Branch Prediction Using Branch History Table.” IBM Technical Disclosure Bull. vol. 22. No. 8A, Jan. 1980, p. 3437.
30. J. Pomerene and R. Reehischatten, “Reducing Cache Misses in a Branch History Table Machine,” IBM Technical Disclosure Bull., vol. 23, No. 2. July 1980, p. 853.
31. P. Smith, private letter, Jan. 3, 1983.
32. G.C. Driscoll et al. “Address Generate Interlock Avoidance tor Branch Instructions in a Branch-History-Table Processor,” IBM leehnieal Diselosure Bull., vol. 24, No. 1 A, June 1981, pp. 350–354.
33. J. J. I osq, “Address Generate Interlock Memory Buffer,” IBM Technical Disclosure Bull., vol. 25, No. 1, June 1982, pp. 1 14–120.
34. A. J. Smith, “A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory,” IEEE Trans. Software Engineering, vol. SP-4, No. 2,Mar. 1978, pp. 121–130.
35. J. K. Pee, “Performance Improvement of CPU Pipe-lines,” PhD dissertation. University of California, Berkeley (to appear 1984).
36. D. Boniface et ah, “Central Control Unit Branch Irace Mechanism,” IBM Technical Disclosure Bull., vol. 24. No. 7A, 1981, pp. 3503–3505.
37. B.I. Petito and I. J. Shustek, “An Instruction liming Model of CPC Performance,” Proc. fourth Symp Computer Architecture, Mar. 1977, pp. 165–178.