Show simple item record

dc.contributor.authorFrias Moya, Leonor
dc.contributor.authorPetit Silvestre, Jordi
dc.contributor.authorRoura Ferret, Salvador
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationFrias, L., Petit, J., Roura, S. "Lists revisited: cache conscious STL lists". 2005.
dc.description.abstractWe 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.
dc.format.extent12 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherCache conscious
dc.titleLists revisited: cache conscious STL lists
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
local.citation.authorFrias, L.; Petit, J.; Roura, S.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder