Aggressive prefetch of address chains

Details Aggressive prefetch of address chains Aggressive prefetch of address chains

2006-11-14

2006-11-14

Dam, Tuan (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Translation of code

C717S154000, C712S207000

Reexamination Certificate

active

07137111

ABSTRACT:
Operations including inserted prefetch operations that correspond to addressing chains may be scheduled above memory access operations that are likely-to-miss, thereby exploiting latency of the “martyred” likely-to-miss operations and improving execution performance of resulting code. More generally, certain pre-executable counterparts of likely-to-stall operations that form dependency chains may be scheduled above operations that are themselves likely-to-stall.

REFERENCES:
patent: 5526499 (1996-06-01), Bernstein et al.
patent: 5948095 (1999-09-01), Arora et al.
patent: 5964867 (1999-10-01), Anderson et al.
patent: 6092180 (2000-07-01), Anderson et al.
patent: 6098166 (2000-08-01), Leibholz et al.
patent: 6308261 (2001-10-01), Morris et al.
patent: 6314431 (2001-11-01), Gornish
patent: 6427235 (2002-07-01), Kosche et al.
patent: 6625660 (2003-09-01), Guthrie et al.
patent: 6675374 (2004-01-01), Pieper et al.
patent: 6675380 (2004-01-01), McKinsey et al.
patent: 6681317 (2004-01-01), Mathews
patent: 6697932 (2004-02-01), Yoaz et al.
patent: 6748589 (2004-06-01), Johnson et al.
patent: 6880073 (2005-04-01), Arimilli et al.
patent: 2002/0056078 (2002-05-01), Inagaki et al.
patent: 2003/0074653 (2003-04-01), Ju et al.
patent: WO 01/44927 (2001-06-01), None
Chi-Keung Luk and Todd Mowry, “Compiler-Based Prefetching for Recursive Data Structures,” APLOS-VII,Proceedings of the Seventh International Conf. on Architectural Support for Programming Languages and Operating Systems, Oct. 1-5, 1996, Cambridge, MA, 12 pp.
M. H. Lipasti, et al. “SPAID: Software Prefetching in Pointer- and Call-Intensive Environments,” Micro 28Proceedings of the 28th Annual International Symposium on Microarchitecture, Nov. 29-Dec. 1, 1995, Ann Arbor, MI, 6 pp.
Todd C. Mowry, Monica S. Lam and Anoop Gupta, “Design and Evaluation of a Compiler Algorithm for Prefetching,” ASPLOS-V, Proceedings of the Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, 1992, pp. 62-73.

Affiliated with

Also associated with

Rating

Aggressive prefetch of address chains does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Aggressive prefetch of address chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Aggressive prefetch of address chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3676885