Top

Published in:

2021 | OriginalPaper | Chapter

A Relaxed Balanced Lock-Free Binary Search Tree

Authors : Manish Singh, Lindsay Groves, Alex Potanin

Published in: Parallel and Distributed Computing, Applications and Technologies

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

This paper presents a new relaxed balanced concurrent binary search tree using a single word compare and swap primitive, in which all operations are lock-free. Our design separates balancing actions from update operations and includes a lock-free balancing mechanism in addition to the insert, search, and relaxed delete operations. Search in our design is not affected by ongoing concurrent update operations or by the movement of nodes by tree restructuring operations. Our experiments show that our algorithm performs better than other state-of-the-art concurrent BSTs.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter The Hybrid Navigation Method in Face of Dynamic Obstacles

next chapter A Dynamic Parameter Tuning Method for High Performance SpMM

A poster describing the design of RBLFBST was presented in ICPP 2019, Kyoto, Japan.

For implementation purpose, the first node to be inserted in the empty tree is kept as the right child of a fixed node root which has key assumed to be infinity.

Detailed explanations and full algorithm for tree-maintenance can be found in [13].

Afek, Y., Kaplan, H., Korenfeld, B., Morrison, A., Tarjan, R.E.: Cbtree: a practical concurrent self-adjusting search tree. In: Aguilera, M.K. (ed.) Distributed Computing, pp. 1–15. Springer, Berlin, Heidelberg (2012)

Barnes, G.: A method for implementing lock-free shared-data structures. In: Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 261–270. SPAA 1993 (1993)

Bougé, L., Vallés, J., Peypoch, X.M., Schabanel, N.: Height-relaxed avl rebalancing: a unified, fine-grained approach to concurrent dictionaries (1998)

Crain, T., Gramoli, V., Raynal, M.: A contention-friendly binary search tree. In: Wolf, F., Mohr, B., an Mey, D. (eds.) Euro-Par 2013. LNCS, vol. 8097, pp. 229–240. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40047-6_25CrossRef

Drachsler, D., Vechev, M., Yahav, E.: Practical concurrent binary search trees via logical ordering. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 343–356, PPoPP 2014. Association for Computing Machinery, New York, NY, USA (2014)

Faith Ellen, P., Fatourou, E.R., van Breugel, F.: Non-blocking binary search trees. In: Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2010, pp. 131–140 (2010)

Fraser, K.: Practical Lock freedom. Ph.D. thesis, King’s College, University of Cambridge September 2003

Guerraoui, R.: Ascylib, July 2020. https://dcl.epfl.ch/site/optik

Harris, T.L.: A pragmatic implementation of non-blocking linked-lists. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 300–314. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45414-4_21CrossRef

10.

Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2008)

11.

Kessels, J.L.W.: On-the-fly optimization of data structures. Commun. ACM 26(11), 895–901 (1983)CrossRef

12.

Larsen, K.S.: Avl trees with relaxed balance. J. Comput. Syst. Sci. 61(3), 508–522 (2000)MathSciNetCrossRef

13.

Singh, M., Lindsay Groves, A.P.: A relaxed balanced lock-free binary search tree. Tech. rep. (2020). https://ecs.wgtn.ac.nz/Main/TechnicalReportSeries

14.

Natarajan, A., Mittal, N.: Fast concurrent lock-free binary search trees. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 317–328. PPoPP 2014, New York, NY, USA (2014)

15.

Bronson, N.G., Casper, J., Chafi, H., Olukotun, K.: A practical concurrent binary search tree. In: ACM SIGPLAN Symposium on Principals and Practice of Parallel Programming (2010)

16.

Nurmi, O., Soisalon-Soininen, E.: Uncoupling updating and rebalancing in chromatic binary search trees. In: Proceedings of the Tenth ACM SIGACT-SIGMOD-SIGART, pp. 192–198. PODS 1991, New York, NY, USA (1991)

17.

Shane V. Howley, J.J.: A non blocking internal binary tree. SPAA, June 2012

18.

Brown, T., Ellen, F., Ruppert, E.: A general technique for non-blocking trees. In: Proceedings of the 19th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP) (2014)

19.

Valois, J.D.: Lock-Free Data Structures. Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY, USA (1996)

Title: A Relaxed Balanced Lock-Free Binary Search Tree
Authors: Manish Singh
Lindsay Groves
Alex Potanin
Publisher: Springer International Publishing
Book: Parallel and Distributed Computing, Applications and Technologies
Print ISBN: 978-3-030-69243-8

Electronic ISBN: 978-3-030-69244-5

Copyright Year: 2021
DOI: https://doi.org/10.1007/978-3-030-69244-5_27

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner