Method and apparatus for prefetching non-sequential...

Electrical computers and digital processing systems: processing – Instruction fetching – Prefetching

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07917731

ABSTRACT:
A processor performs a prefetch operation on non-sequential instruction addresses. If a first instruction address misses in an instruction cache and accesses a higher-order memory as part of a fetch operation, and a branch instruction associated with the first instruction address or an address following the first instruction address is detected and predicted taken, a prefetch operation is performed using a predicted branch target address, during the higher-order memory access. If the predicted branch target address hits in the instruction cache during the prefetch operation, associated instructions are not retrieved, to conserve power. If the predicted branch target address misses in the instruction cache during the prefetch operation, a higher-order memory access may be launched, using the predicted branch instruction address. In either case, the first instruction address is re-loaded into the fetch stage pipeline to await the return of instructions from its higher-order memory access.

REFERENCES:
patent: 4943908 (1990-07-01), Emma et al.
patent: 4984151 (1991-01-01), Dujari
patent: 5642500 (1997-06-01), Inoue
patent: 5701435 (1997-12-01), Chi
patent: 5987599 (1999-11-01), Poplingher et al.
patent: 6012134 (2000-01-01), McInerney et al.
patent: 6119222 (2000-09-01), Shiell et al.
patent: 6212603 (2001-04-01), McInerney et al.
patent: 6324643 (2001-11-01), Krishnan et al.
patent: 6651162 (2003-11-01), Levitan et al.
patent: 6658534 (2003-12-01), White et al.
patent: 6665776 (2003-12-01), Jouppi et al.
patent: 6728839 (2004-04-01), Marshall
patent: 6912650 (2005-06-01), Ukai et al.
patent: 2001/0044881 (2001-11-01), Fu et al.
patent: 2002/0087794 (2002-07-01), Jouppi et al.
patent: 2003/0204705 (2003-10-01), Oldfield et al.
patent: 2003/0233521 (2003-12-01), Pudipeddi et al.
patent: 2004/0133769 (2004-07-01), Chaudhry et al.
patent: 2005/0132173 (2005-06-01), Moyer et al.
patent: 2005/0257034 (2005-11-01), Caprioli et al.
patent: 2006/0200655 (2006-09-01), Smith et al.
patent: 2006/0224871 (2006-10-01), Tran
patent: 2008/0140996 (2008-06-01), Morrow et al.
patent: 2008/0209173 (2008-08-01), Evers et al.
Dundas (Improving Processor Performance by Dynamically Pre-Processing the Instruction Stream); PhD thesis, University of Michigan, 1998.
Smith et al. (Smith) (Prefetching in Supercomputer Instruction Caches); This paper appears in: Supercomputing '92. Proceedings; Publication Date: Nov. 16-20, 1992; On pp. 588-597; Meeting Date: Nov. 16, 1992-Nov. 20, 1992.
Guo et al. (Guo) (Energy Characterization of Hardware-Based Data Prefetching); This paper appears in: Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings. IEEE International Conference on Publication Date: Oct. 11-13, 2004 On pp. 518-523.
Lee et al. (Instruction Cache Fetch Policies for Speculative Execution); This paper appears in: Computer Architecture, 1995. Proceedings. 22nd Annual International Symposium onPublication Date: Jun. 22-24, 1995 On pp. 357-367.
Srinivasan et al. (Branch History Guided Instruction Prefetching) Proceedings of the 7th International Symposium on High-Performance Computer Architecture; p. 291; Year of Publication: 2001.
Chen et al. (Instruction prefetching using branch prediction information )Computer Design: VLSI in Computers and Processors, 1997. ICCD '97. Proceedings., 1997 IEEE International Conference on Publication Date: Oct. 12-15, 1997; On pp. 593-601.
Smith (Cache Memories); ACM Computing Surveys (CSUR); vol. 14 , Issue 3 (Sep. 1982) pp. 473-530 Year of Publication: 1982.
Mutlu et al. (Runahead Execution: An Effective Alternative to Large Instruction Windows); This paper appears in: High-Performance Computer Architecture, 2003. HPCA-9 2003. Proceedings. The Ninth International Symposium on Publication Date: Feb. 8-12, 2003; On pp. 129-140.
Reinman (Fetch Directed Instruction Prefetching); Microarchitecture, 1999. MICRO-32. Proceedings. 32nd Annual International Symposium on; Publication Date: 1999; On pp. 16-27.
Chiu et al. (Instruction Cache Prefetching Directed by Branch Prediction); This paper appears in: Computers and Digital Techniques, IEE Proceedings; Publication Date: Sep. 1999; vol. 146, Issue: 5; On pp. 241-246.
Chen et al. (Instruction Prefetching using Branch Prediction Information); This paper appears in: Computer Design: VLSI in Computers and Processors, 1997. ICCD '97. Proceedings., 1997 IEEE International Conference on; Publication Date: Oct. 12-15, 1997; On pp. 593-601.
Veidenbaum (Instruction Cache Prefetching Using Multilevel Branch Prediction); International Symposium on High Performance Systems; 1997, 20 pages.
Hsu et al. (A Performance Study of Instruction Cache Prefetching Methods) ; IEEE Transaction on Computers; May 1998 (vol. 47 No. 5); pp. 497-508.
Zhang et al. (Execution History Guided Instruction Prefetching); Journal of supercomputing ; 2004, vol. 27, pp. 129-147.
Huang et al. (Instruction Prefetching and Object-Oriented Programs); accessible at http://www.cs.cmu.edu/˜pach/740/final/final.html; Dated Nov. 22, 1999, Retrieved Jan. 6, 2010; 19 pages.

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

Method and apparatus for prefetching non-sequential... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and apparatus for prefetching non-sequential..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for prefetching non-sequential... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2711257

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