A programmable memory hierarchy for prefetching linked data structures

DOI10.1007/3-540-47847-7_15MaRDI QIDQ4738696zbMATH OpenFDO

Authors Chia-Lin Yang, Alvin R. Lebeck

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2327/23270160.htm

Mathematics Subject Classification ID

Computer system organization (68M99) Data structures (68P05) Computing methodologies and applications (68U99)

Recommendations

• Memory-side prefetching for linked data structures for processor-in-memory systems
• Content-based prefetching: initial results
• Load-balancing data prefetching techniques
• Speculative prefetching of \textbf{induction pointers}
• A PAB-based multi-prefetcher mechanism

Cited in

(7)

• Context-based prefetch --- an optimization for implementing objects on relations
• Memory-side prefetching for linked data structures for processor-in-memory systems
• Speculative prefetching of \textbf{induction pointers}
• Effective hardware-based data prefetching for high-performance processors
• Content-based prefetching: initial results
• Runtime association of software prefetch control to memory access instructions
• Data block prefetching and caching in a hierarchical storage model

This page was built for publication: A programmable memory hierarchy for prefetching linked data structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4738696)