Show simple item record

dc.contributor.authorUmar, Ibrahim
dc.contributor.authorAnshus, Otto
dc.contributor.authorHa, Hoai Phuong
dc.date.accessioned2016-02-22T13:14:23Z
dc.date.available2016-02-22T13:14:23Z
dc.date.issued2015-06-15
dc.description.abstractLike other fundamental abstractions for high-performance computing, search trees need to support both high concurrency and data locality. However, existing locality-aware search trees based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations. We present DeltaTree, a practical locality-aware concurrent search tree that integrates both locality-optimization techniques from vEB-based trees, and concurrency-optimization techniques from highly-concurrent search trees. As a result, DeltaTree minimizes data transfer from memory to CPU and supports high concurrency. Our experimental evaluation shows that DeltaTree is up to 50% faster than highly concurrent B-trees on a commodity Intel high performance computing (HPC) platform and up to 65% faster on a commodity ARM embedded platform.en_US
dc.description© ACM, 2015. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in Performance Evaluation Review 2015, 43(1):457-458. Published version available at <a href=http://dx.doi.org/10.1145/2796314.2745891>http://dx.doi.org/10.1145/2796314.2745891</a>en_US
dc.identifier.citationPerformance Evaluation Review 2015, 43(1):457-458en_US
dc.identifier.cristinIDFRIDAID 1264273
dc.identifier.doi10.1145/2796314.2745891
dc.identifier.issn0163-5999
dc.identifier.urihttps://hdl.handle.net/10037/8529
dc.identifier.urnURN:NBN:no-uit_munin_8100
dc.language.isoengen_US
dc.publisherAssociation for Computing Machineryen_US
dc.relation.projectIDNorges forskningsråd: 231746en_US
dc.rights.accessRightsopenAccess
dc.subjectVDP::Matematikk og Naturvitenskap: 400::Informasjons- og kommunikasjonsvitenskap: 420::Algoritmer og beregnbarhetsteori: 422en_US
dc.subjectVDP::Mathematics and natural science: 400::Information and communication science: 420::Algorithms and computability theory: 422en_US
dc.subjectPerformance evaluationen_US
dc.subjectconcurrent algorithmsen_US
dc.subjectdata localityen_US
dc.subjectmulti-core processorsen_US
dc.subjectmemory systemsen_US
dc.titleDeltaTree: A Locality-aware Concurrent Search Treeen_US
dc.typeJournal articleen_US
dc.typeTidsskriftartikkelen_US
dc.typePeer revieweden_US


File(s) in this item

Thumbnail

This item appears in the following collection(s)

Show simple item record