Cache-Conscious Allocation of Pointer-Based Data Structures Revisited with HW/SW Prefetching
2003 (English)Conference paper (Refereed)
As memory access times continue to be a bottleneck, differential research is required for better understanding of memory access performance. Studies of cache-conscious allocation and software prefetch have recently sparked research in the area of software optimizations on memory, as pointer-based data structures previously have been elusive to the optimizing techniques available. Research on hardware prefetch mechanisms have in some cases shown improvements, but less analytical schemes have tended to degrade performance for pointer-based data structures. This paper combines four hardware schemes, normally not efficient on pointer-based data structures, and a greedy software prefetch with cache-conscious allocation to evaluate positive effects of increased locality, in a comparative evaluation, on five level 1 data cache line sizes. We show that cache-conscious allocation utilizes large cache lines efficiently and that none of the prefetch strategies evaluated add significantly to the effect already achieved by the cache-conscious allocation on the hardware evaluated. The passive prefetching mechanism of using large cache lines with cache-conscious allocation is by far outstanding.
Place, publisher, year, edition, pages
2003. 2-13 p.
IdentifiersURN: urn:nbn:se:kth:diva-109693OAI: oai:DiVA.org:kth-109693DiVA: diva2:584871
Proceedings of the 2003 Workshop on Duplicating, Deconstructing and Debunking (WDDD-2)
NR 201408052013-01-092013-01-082013-01-09Bibliographically approved