Adaptive prefetch for irregular access patterns

Details Adaptive prefetch for irregular access patterns Adaptive prefetch for irregular access patterns

2006-12-26

2006-12-26

Bataille, Pierre-Michel (Department: 2186)

Electrical computers and digital processing systems: memory

Storage accessing and control

Hierarchical memories

C711S169000, C712S207000

Reexamination Certificate

active

07155575

ABSTRACT:
A computer program product determines whether a loop has a high usage count. If the computer program product determines the loop has a high usage count, the computer program product determines whether the loop has an irregularly accessed load. If the loop has an irregularly accessed load, the computer program product inserts pattern recognition code to calculate whether successive iterations of the irregular memory load in the loop have a predictable access pattern. The computer program product implants conditional adaptive prefetch code including a prefetch instruction into the output code.

REFERENCES:
patent: 5778435 (1998-07-01), Berenbaum et al.
patent: 5854934 (1998-12-01), Hsu et al.
patent: 5941981 (1999-08-01), Tran
patent: 6055622 (2000-04-01), Spillinger
patent: 6079006 (2000-06-01), Pickett
patent: 6134643 (2000-10-01), Kedem et al.
patent: 6381669 (2002-04-01), Chudnovsky et al.
patent: 6560693 (2003-05-01), Puzak et al.
patent: 6571318 (2003-05-01), Sander et al.
patent: 6609168 (2003-08-01), Willke, II
patent: 6820173 (2004-11-01), Bittel et al.
patent: 2002/0095563 (2002-07-01), Chaudhry et al.
patent: 2004/0006667 (2004-01-01), Bik et al.
patent: 2004/0093591 (2004-05-01), Kalogeropulos et al.
Tien-Fu Chen et al, “Effective Hardware-Based Data Prefetching for High-Performance Processors,” IEEE Transactions on Computers, 1995.
“Code Generation for Streaming: an Access/Execute Mechanism,” by Manuel E. Benitez et al., XP 00203256, 8345 Computer Architecture News, Apr. 19, 1991, No. 2, New York, pp. 132-141.
“Branch-Directed and Stride-Based Data Cache Prefetching”, Yue Liu and David R. Kaeli, Prceedings of the International Conference on Computer Design (pp. 225-229), 1996.
Krishnan et al., “Optimal Prediction for Prefetching in the Worst Case”, DUKE-CS-93-26 pp. 1-24.
“Compiler-Based Prefetching for Recursive Data Structures”, Chi-Keung Luk and Todd C. Mowry, Department of Computer Science, Department of Electrical & Computer Engineering, University of Toronto, Toronto, Canada M5S3G4, pp. 1-12.
“Compiler-directed Data Prefetching in Multiprocessors with Memory Hierarchies”, Edward H. Gornish, Elana D. Granston & Alexander V. Veidenbaum, Center for Supercomputing Research & Development, University of Illinois at Urbana-Champaign, Urbana, Illinois 61801, pp. 1-15.
“Data Prefetch Mechanism”, Steven P. VanderWiel and David J. Lilja, Department of Electrical & Computer Engineering, University of Minnesota, 200 Union St. SE, Minneapolis, MN 55455, pp. 1-25.
“Value Profile Guided Stride Prefetching for Irregular Code”, Youfeng Wu, Mauricio Serranco, Rakesh Krishnaiyer, Wei Li, and Jessie Fang, Intel Programming Systems Research Lab, Intel Compiler Lab, 2200 Mission College Blvd., Santa Clara, CA 95052, pp. 1-17.

Affiliated with

Also associated with

Rating

Adaptive prefetch for irregular access patterns does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Adaptive prefetch for irregular access patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive prefetch for irregular access patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3687321