Article thumbnail

TLB misses: the missing issue of adaptive radix tree?

By E Lo, W Xu, Z Feng, B Kao and PKF Wong

Abstract

Efficient 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.link_to_OA_fulltex

Publisher: 'Association for Computing Machinery (ACM)'
Year: 2015
DOI identifier: 10.1145/2771937.2771942
OAI identifier: oai:hub.hku.hk:10722/214762
Provided by: HKU Scholars Hub
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/10722/21... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.