Cache memory system for dynamically altering single cache memory

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395425, G06F 1208, G06F 930

Patent

active

057489327

ABSTRACT:
A processor with a branch target cache (BTC) and multiple instruction prefetch storage circuits. A control mechanism allows the fetching of instructions to be transferred from a first prefetch storage circuit to a second prefetch storage circuit which contains branch target instruction bytes. The control is transferred based on a prediction of whether the branch will be taken using history bits associated with the branch instruction. If the processor later determines that the branch is mispredicted, the execution of instructions resumes from the first prefetch storage circuit.

REFERENCES:
patent: 3940741 (1976-02-01), Horikoshi et al.
patent: 4200927 (1980-04-01), Hughes et al.
patent: 4287561 (1981-09-01), Liptay
patent: 4295193 (1981-10-01), Pomerene
patent: 4430706 (1984-02-01), Sand
patent: 4442488 (1984-04-01), Hall
patent: 4477872 (1984-10-01), Losq et al.
patent: 4521850 (1985-06-01), Wilhite et al.
patent: 4521851 (1985-06-01), Trubisky et al.
patent: 4594659 (1986-06-01), Guenthner et al.
patent: 4604691 (1986-08-01), Akagi
patent: 4631660 (1986-12-01), Woffinden et al.
patent: 4679141 (1987-07-01), Pomerene et al.
patent: 4691277 (1987-09-01), Kronstadt et al.
patent: 4714994 (1987-12-01), Oklobdzija et al.
patent: 4722050 (1988-01-01), Lee et al.
patent: 4725947 (1988-02-01), Shonai et al.
patent: 4742451 (1988-05-01), Bruckert et al.
patent: 4763245 (1988-08-01), Emma et al.
patent: 4775955 (1988-10-01), Liu
patent: 4777587 (1988-10-01), Case et al.
patent: 4777594 (1988-10-01), Jones et al.
patent: 4796175 (1989-01-01), Matsuo et al.
patent: 4802113 (1989-01-01), Onishi et al.
patent: 4827402 (1989-05-01), Wada
patent: 4847753 (1989-07-01), Matsuo et al.
patent: 4853840 (1989-08-01), Shibuya
patent: 4858104 (1989-08-01), Matsuo et al.
patent: 4860197 (1989-08-01), Langendorf et al.
patent: 4860199 (1989-08-01), Langendorf et al.
patent: 4881170 (1989-11-01), Morisada
patent: 4882673 (1989-11-01), Witt
patent: 4894772 (1990-01-01), Langendorf
patent: 4905188 (1990-02-01), Chuang et al.
patent: 4912635 (1990-03-01), Nishimukai et al.
patent: 4926323 (1990-05-01), Baror et al.
patent: 4933837 (1990-06-01), Freidin
patent: 4942520 (1990-07-01), Langendorf
patent: 4943908 (1990-07-01), Emma et al.
patent: 4974154 (1990-11-01), Matsuo
patent: 4974155 (1990-11-01), Dulong et al.
patent: 4984154 (1991-01-01), Hanatani et al.
patent: 4991078 (1991-02-01), Wilheim et al.
patent: 4991080 (1991-02-01), Emma et al.
patent: 5050068 (1991-09-01), Dollas et al.
patent: 5072364 (1991-12-01), Jardine et al.
patent: 5093778 (1992-03-01), Favor et al.
patent: 5101341 (1992-03-01), Circello et al.
patent: 5127091 (1992-06-01), Boufarah et al.
patent: 5136696 (1992-08-01), Beckwith et al.
patent: 5136697 (1992-08-01), Johnson
patent: 5142634 (1992-08-01), Fite et al.
patent: 5163140 (1992-11-01), Stiles et al.
patent: 5237666 (1993-08-01), Suzuki et al.
Murakami et al., "A Novel High-Speed-Processor Architecture" ACM, pp. 78-85, 1989.
"The IBM System/360 Model 91: Machine Philosophy and Instruction-Handling," D.W. Anderson, et al., IBM Journal, Jan. 1967, pp. 8-24.
"Instruction Fetch," J.F. Hughes, et al, IBM Technical Disclosure Bulletin, vol. 24, No. 4, Sep. 1981, IBM Corp., pp. 1859, 1860.
"IBM 3033 Processor Complex," Sec. 6.6.4, The Architecture of Pipelined Computers, Peter M. Kogge, 1981, Hemisphere Publishing Company, pp. 281-286.
"Branch Prediction Strategies and Branch Target Buffer Design," Johnny K.F. Lee, et al., Computer, 1984, pp. 6-22.
"Cache Memories," Alan Jay Smith, Computing Surveys, vol. 14, No. 3, Sep. 1982, pp. 473-530.
"A Study of Branch Prediction Strategies," James E. Smith, Computer, 1981, pp. 135-148.
"Pipeline Architecture," C.V. Ramamoorthy, et al, Computer Surveys, vol. 9, No. 1, Mar. 1977, pp. 61-102.
"Reducing the Cost of Branches," Scott McFarling, et al, Computer, 1986, pp. 396-403.
"Reducing the Branch Penalty in Pipelined Processors," Lilja, Computer, Jul. 1988, pp. 47-55.
"Design Tradeoffs for a 40 MIPS (Peak) CMOS 32-Bit Microprocessor," D.K. Lewis, et al, Computer, 1988, pp. 110-113.
"Comparing Software and Hardware Schemes for Reducing the Cost of Branches," Wen-mei W. Hwu, et al, Computer Architecture News, vol. 17, No. 3, 1989, pp. 224-233.
"Machine Organizatio of the IBM RISC System/6000 Processor," G.F. Grohoski, IBM J. Res. Develop., vol. 34, No. 1, Jan. 1990, pp. 37-58.
"Branch Strategies: Modeling and Optimization," Pradeep K. Dubey, et al, Technical Report: CSL-TR90-411, Feb. 1990, Computer Systems Laboratory, Stanford University, pp. i-49.
"Branch Folding in the CRISP Microprocessor: Reducing Branch Delay to Zero," David R. Ditzel, et al., ACM 0084-7495/87/0600-0002, 1987, pp. 2-9.
"Piperline Control for a Single Cycle VLSI Implementation of a Complex Instruction Set Computer," David R. Stiles, et al, Computer Society of the IEEE, pp. 504-508.
"A Single Cycle VLSI CIS-C Based Workstation: System Overview and Performance Characteristics," A. Thampy Thomas, Computer Society of the IEEE, pp. 500-503.
"Technology Constraints on VLSI Processor Implementation," Atig Raza, Computer Society of the Thirty-Fourth IEEE, pp. 509-512.
The Mitsibushi VLSI CPU in the TRON Project, T. Yoshida, et al., Apr. 1987, IEEE Micro, p. 24.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Cache memory system for dynamically altering single cache memory does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cache memory system for dynamically altering single cache memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cache memory system for dynamically altering single cache memory will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-68211

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.