A lock-free B+tree

Anastasia Braginsky; Erez Petrank

doi:10.1145/2312005.2312016

A lock-free B+tree

Anastasia Braginsky, Erez Petrank

Computer Science

Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B ⁺tree. The B ⁺tree data structure has an important practical applications, and is used in various storage-system products. As far as we know this is the first design of a lock-free, dynamic, and balanced tree, that employs standard compare-and-swap operations.

Original language	English
Title of host publication	SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures
Pages	58-67
Number of pages	10
DOIs	https://doi.org/10.1145/2312005.2312016
State	Published - 2012
Event	24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12 - Pittsburgh, PA, United States Duration: 25 Jun 2012 → 27 Jun 2012

Publication series

Name	Annual ACM Symposium on Parallelism in Algorithms and Architectures

Conference

Conference	24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12
Country/Territory	United States
City	Pittsburgh, PA
Period	25/06/12 → 27/06/12

Keywords

B tree
Concurrent data structures
Lock-freedom
Parallel programming
Progress guarantee

All Science Journal Classification (ASJC) codes

Software
Theoretical Computer Science
Hardware and Architecture

Access to Document

10.1145/2312005.2312016

Cite this

@inproceedings{97a6f299961542b5804eb4ebe0868a64,

title = "A lock-free B+tree",

abstract = "Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B +tree. The B +tree data structure has an important practical applications, and is used in various storage-system products. As far as we know this is the first design of a lock-free, dynamic, and balanced tree, that employs standard compare-and-swap operations.",

keywords = "B tree, Concurrent data structures, Lock-freedom, Parallel programming, Progress guarantee",

author = "Anastasia Braginsky and Erez Petrank",

year = "2012",

doi = "10.1145/2312005.2312016",

language = "الإنجليزيّة",

isbn = "9781450312134",

series = "Annual ACM Symposium on Parallelism in Algorithms and Architectures",

pages = "58--67",

booktitle = "SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures",

note = "24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12 ; Conference date: 25-06-2012 Through 27-06-2012",

}

Braginsky, A & Petrank, E 2012, A lock-free B+tree. in SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures. Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 58-67, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12, Pittsburgh, PA, United States, 25/06/12. https://doi.org/10.1145/2312005.2312016

TY - GEN

T1 - A lock-free B+tree

AU - Braginsky, Anastasia

AU - Petrank, Erez

PY - 2012

Y1 - 2012

N2 - Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B +tree. The B +tree data structure has an important practical applications, and is used in various storage-system products. As far as we know this is the first design of a lock-free, dynamic, and balanced tree, that employs standard compare-and-swap operations.

AB - Lock-free data structures provide a progress guarantee and are known for facilitating scalability, avoiding deadlocks and livelocks, and providing guaranteed system responsiveness. In this paper we present a design for a lock-free balanced tree, specifically, a B +tree. The B +tree data structure has an important practical applications, and is used in various storage-system products. As far as we know this is the first design of a lock-free, dynamic, and balanced tree, that employs standard compare-and-swap operations.

KW - B tree

KW - Concurrent data structures

KW - Lock-freedom

KW - Parallel programming

KW - Progress guarantee

UR - http://www.scopus.com/inward/record.url?scp=84864115817&partnerID=8YFLogxK

U2 - 10.1145/2312005.2312016

DO - 10.1145/2312005.2312016

M3 - منشور من مؤتمر

SN - 9781450312134

T3 - Annual ACM Symposium on Parallelism in Algorithms and Architectures

SP - 58

EP - 67

BT - SPAA'12 - Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures

T2 - 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'12

Y2 - 25 June 2012 through 27 June 2012

ER -

A lock-free B+tree

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this