About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Interpreted as:

title:(ELB-trees AND Efficient AND Lock-free AND B+trees)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
1 Conference paper

ELB-trees - Efficient Lock-free B+trees

Year: 2014

Language: English

jchnolepadg bm fk i
2 Conference paper

ELB-trees - Efficient Lock-free B+trees

Bonnichsen, Lars Frydendal; Karlsson, Sven; Probst, Christian W.

Proceedings of the 10th International Summer School on Advanced Computer Architecture and Compilation for High-performance and Embedded Systems (acaces 2014) — 2014

As computer systems scale in the number of processors, data structures with good parallel performance become increasingly important. Lock-free data structures promise improved parallel performance at the expense of higher complexity and sequential execution time.We present ELBtrees, a new lock-free

Year: 2014

Language: English

ijpg fhmno abelkcd
3 Conference paper

ELB-trees - Efficient Lock-free B+trees

Year: 2014

Language: English

kejhl i bnfod mcapg
4 Preprint article

ELB-Trees, An Efficient and Lock-free B-tree Derivative

This technical report is an extension of the paper of the same title, which is to appear at MUCOCOS'13. The technical report proves correctness of the ELB-trees operations' semantics and that the operations are lock-free.

Year: 2013

Language: Undetermined

po bncajg mi fledkh
5 Conference paper

ELB-trees an efficient and lock-free B-tree derivative

Bonnichsen, Lars Frydendal; Karlsson, Sven; Probst, Christian W.

2013 Ieee 6th International Workshop on Multi-/many-core Computing Systems (mucocos) — 2013, pp. 1-10

overhead. All lock-free data structures are based on simple atomic operations that, though supported by modern processors, are expensive in execution time. We present a lock-free data structure, ELB-trees, which under certain assumptions can be used as multimaps as well as priority queues. Specifically

Year: 2013

Language: English

ncpjdifk oebl m hag

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user