Improving cache performance (2009)
by
Mark Adcock
,
Mark Adcock
BibTeX
@MISC{Adcock09improvingcache,
author = {Mark Adcock and Mark Adcock},
title = {Improving cache performance},
year = {2009}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Some figures in this document are best viewed in colour. If you received a black-and-white copy, please consult the online version if necessary. Technical reports published by the University of Cambridge Computer Laboratory are freely available via the Internet:
Citations
| 416 | Uniprocessor garbage collection techniques, Yves Bekkers and Jacques Cohen (eds - Wilson - 1992 |
| 50 | Improving cache behavior of dynamically allocated data structures - TRUONG, BODIN, et al. - 1998 |
| 43 | Effective “static-graph” reorganization to improve locality in garbage-collected systems - Wilson, Lam, et al. - 1991 |
| 34 | Efficient discovery of regular stride patterns in irregular programs and its use in compiler prefetching - Wu |
| 23 | A brief introduction to regions - Tofte - 1998 |
| 17 | Address/memory management for a gigantic LISP environment; or, GC considered harmful - White - 1980 |
| 4 | Accurate data layout into blocks may boost cache performance - Truong, Bodin, et al. - 1997 |
| 1 | Value-profile guided stride prefetching for irregular code - Wu, Serrano, et al. - 2002 |
