Memory-side prefetching for linked data structures for processor-in-memory systems

DOI10.1016/J.JPDC.2004.11.004zbMATH Open1101.68491OpenAlexW2071635084MaRDI QIDQ2485151FDOQ2485151

Authors: Christopher Hughes, Sarita V. Adve 

Publication date: 3 August 2005

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2004.11.004

Recommendations

• scientific article; zbMATH DE number 2087757
• scientific article; zbMATH DE number 1693501
• Minimizing average schedule length under memory constraints by optimal partitioning and prefetching
• Effective hardware-based data prefetching for high-performance processors
• scientific article; zbMATH DE number 1753943

zbMATH Keywords

PrefetchingLinked data structuresProcessor-in-memory

Mathematics Subject Classification ID

Data structures (68P05)

Cited In (5)

• A PAB-based multi-prefetcher mechanism
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Memory-Link Compression Schemes: A Value Locality Perspective

This page was built for publication: Memory-side prefetching for linked data structures for processor-in-memory systems

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