SIGN IN
SIGN UP
A general framework for prefetch scheduling in linked data structures and its application to multi-chain prefetching
Full Text:
Pdf
Buy this Article
Authors:
Seungryul Choi
University of Maryland, College Park, MD
Nicholas Kohout
EVI Technology LLC, Columbia, MD
Sumit Pamnani
Advanced Micro Devices, Inc., Austin, TX
Dongkeun Kim
University of Maryland, College Park, MD
Donald Yeung
University of Maryland, College Park, MD
2004 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 51
· Downloads (cumulative): 1,523
· Citation Count: 5
Published in:
· Journal
ACM Transactions on Computer Systems (TOCS)
TOCS Homepage
archive
Volume 22 Issue 2, May 2004
Pages 214 - 280
ACM
New York, NY
, USA
table of contents
doi>
10.1145/986533.986536
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
cache memories
compilers
data prefetching
design
design studies
experimentation
memory parallelism
modeling of computer architecture
performance
performance analysis and design aids
pointer-chasing code
system architectures
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder