File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: TLB misses: the missing issue of adaptive radix tree?

TitleTLB misses: the missing issue of adaptive radix tree?
Authors
Issue Date2015
PublisherThe Association for Computing Machinery.
Citation
The 11th International Workshop on Data Management on New Hardware (DaMoN 2015), Melbourne, VIC., Australia, 1 June 2015. In Conference Proceedings, 2015, p. 1-7, article no. 6 How to Cite?
AbstractEfficient main-memory index structures are crucial to main-memory database systems. Adaptive Radix Tree (ART) is the most recent in-memory index structure. ART is designed to avoid cache miss, leverage SIMD data parallelism, minimize branch mis-prediction, and have small memory foot-print. When an in-memory index structure like ART has significantly few cache misses and branch mis-predictions, it is natural to question whether misses in Translation Lookaside Buffer (TLB) matters. In this paper, we try to confirm whether this is the case and if the answer is positive, what are the measures that we can take to alleviate that and how effective they are.
Persistent Identifierhttp://hdl.handle.net/10722/214762
ISBN

 

DC FieldValueLanguage
dc.contributor.authorWong, PKF-
dc.contributor.authorFeng, Z-
dc.contributor.authorXu, W-
dc.contributor.authorLo, E-
dc.contributor.authorKao, B-
dc.date.accessioned2015-08-21T11:54:30Z-
dc.date.available2015-08-21T11:54:30Z-
dc.date.issued2015-
dc.identifier.citationThe 11th International Workshop on Data Management on New Hardware (DaMoN 2015), Melbourne, VIC., Australia, 1 June 2015. In Conference Proceedings, 2015, p. 1-7, article no. 6-
dc.identifier.isbn978-1-4503-3638-3-
dc.identifier.urihttp://hdl.handle.net/10722/214762-
dc.description.abstractEfficient main-memory index structures are crucial to main-memory database systems. Adaptive Radix Tree (ART) is the most recent in-memory index structure. ART is designed to avoid cache miss, leverage SIMD data parallelism, minimize branch mis-prediction, and have small memory foot-print. When an in-memory index structure like ART has significantly few cache misses and branch mis-predictions, it is natural to question whether misses in Translation Lookaside Buffer (TLB) matters. In this paper, we try to confirm whether this is the case and if the answer is positive, what are the measures that we can take to alleviate that and how effective they are.-
dc.languageeng-
dc.publisherThe Association for Computing Machinery.-
dc.relation.ispartofProceedings of the Proceedings of the 11th International Workshop on Data Management on New Hardware (DaMoN'15)-
dc.titleTLB misses: the missing issue of adaptive radix tree?-
dc.typeConference_Paper-
dc.identifier.emailKao, B: kao@cs.hku.hk-
dc.identifier.authorityKao, B=rp00123-
dc.description.naturelink_to_OA_fulltext-
dc.identifier.doi10.1145/2771937.2771942-
dc.identifier.hkuros249902-
dc.identifier.spage1-
dc.identifier.epage7-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats