File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/2771937.2771942
- Scopus: eid_2-s2.0-84959876359
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: TLB misses: the missing issue of adaptive radix tree?
Title | TLB misses: the missing issue of adaptive radix tree? |
---|---|
Authors | |
Issue Date | 2015 |
Publisher | The 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? |
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. |
Persistent Identifier | http://hdl.handle.net/10722/214762 |
ISBN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Wong, PKF | - |
dc.contributor.author | Feng, Z | - |
dc.contributor.author | Xu, W | - |
dc.contributor.author | Lo, E | - |
dc.contributor.author | Kao, B | - |
dc.date.accessioned | 2015-08-21T11:54:30Z | - |
dc.date.available | 2015-08-21T11:54:30Z | - |
dc.date.issued | 2015 | - |
dc.identifier.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 | - |
dc.identifier.isbn | 978-1-4503-3638-3 | - |
dc.identifier.uri | http://hdl.handle.net/10722/214762 | - |
dc.description.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. | - |
dc.language | eng | - |
dc.publisher | The Association for Computing Machinery. | - |
dc.relation.ispartof | Proceedings of the Proceedings of the 11th International Workshop on Data Management on New Hardware (DaMoN'15) | - |
dc.title | TLB misses: the missing issue of adaptive radix tree? | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Kao, B: kao@cs.hku.hk | - |
dc.identifier.authority | Kao, B=rp00123 | - |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1145/2771937.2771942 | - |
dc.identifier.scopus | eid_2-s2.0-84959876359 | - |
dc.identifier.hkuros | 249902 | - |
dc.identifier.spage | 1 | - |
dc.identifier.epage | 7 | - |
dc.publisher.place | United States | - |