Effective jump-pointer prefetching for linked data structures

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Amir Roth Computer Sciences Department, University of Wisconsin, Madison
Gurindar S. Sohi Computer Sciences Department, University of Wisconsin, Madison
Published in:
Cover Image
Cover Image
 
· Proceeding
ISCA '99 Proceedings of the 26th annual international symposium on Computer architecture
Pages 111-121
IEEE Computer Society Washington, DC, USA ©1999
table of contents ISBN:0-7695-0170-2 doi>10.1145/300979.300989
· Newsletter
ACM SIGARCH Computer Architecture News - Special Issue: Proceedings of the 26th annual international symposium on Computer architecture (ISCA '99) Homepage
Volume 27 Issue 2, May 1999
Pages 111-121
ACM New York, NY, USA
table of contents doi>10.1145/307338.300989
Effective jump-pointer prefetching for linked data structures 1999 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 19
· Downloads (cumulative): 609
· Citation Count: 53


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder