Lists revisited: cache conscious STL lists
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...
| Authors: | , , |
|---|---|
| Format: | report |
| Publication Date: | 2005 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/85664 |
| Online Access: | https://hdl.handle.net/2117/85664 |
| Access Level: | Open access |
| Keyword: | STL List Iterator Cache conscious Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Summary: | 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. |
|---|