We present three cache conscious implementations of STL standard compliant lists. Up to now, one could either find simple double linked list implementations that easily cope with standard strict requirements, or theoretical approaches that do not take into account any of these requirements in their design. In contrast, we have merged both approaches, paying special attention to iterators constraints. In this paper, we show the competitiveness of our implementations with an extensive experimental analysis. This shows, for instance, 5-10 times faster traversals and 3-5 times faster internal sort. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Frias, L., Petit, J., & Roura, S. (2006). Lists revisited: Cache conscious STL lists. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4007 LNCS, pp. 121–133). Springer Verlag. https://doi.org/10.1007/11764298_11
Mendeley helps you to discover research relevant for your work.