ELB-trees - Efficient Lock-free B+trees

Research output: Chapter in Book/Report/Conference proceedingConference abstract in proceedings – Annual report year: 2014Researchpeer-review

Documents

View graph of relations

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 dictionary with simple synchronization in the common case, making it almost
30 times faster than sequential library implementations at 24 threads.
Original languageEnglish
Title of host publicationProceedings of the 10th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems (ACACES 2014)
Number of pages4
Publication date2014
Publication statusPublished - 2014
Event10th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems, ACACES 2014 - Fiuggi, Italy
Duration: 13 Jul 201419 Jul 2014
Conference number: 10
http://www.hipeac.net/acaces2014/index.php?page=home

Course

Course10th International Summer School on Advanced Computer Architecture and Compilation for High-Performance and Embedded Systems, ACACES 2014
Number10
CountryItaly
CityFiuggi
Period13/07/201419/07/2014
Internet address

Download statistics

No data available

ID: 102419167