Making pointer-based data structures cache conscious
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 33 (12) , 67-74
- https://doi.org/10.1109/2.889095
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Memory forwarding: enabling aggressive layout optimizations by guaranteeing the safety of data relocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Cache-conscious structure layoutPublished by Association for Computing Machinery (ACM) ,1999
- Cache-conscious structure definitionACM SIGPLAN Notices, 1999
- Cache-conscious data placementPublished by Association for Computing Machinery (ACM) ,1998
- Using generational garbage collection to implement cache-conscious data placementPublished by Association for Computing Machinery (ACM) ,1998
- Studies of Windows NT performance using dynamic execution tracesPublished by Association for Computing Machinery (ACM) ,1996
- Effective “static-graph” reorganization to improve locality in garbage-collected systemsACM SIGPLAN Notices, 1991
- Ubiquitous B-TreeACM Computing Surveys, 1979