balanced binary search tree
play

Balanced Binary Search Tree Dana Drachsler, Technion, Israel Joint - PowerPoint PPT Presentation

Oct 19, 2023 •163 likes •1.03k views

Verification-Friendly Concurrent Balanced Binary Search Tree Dana Drachsler, Technion, Israel Joint work with: Martin Vechev, ETH, Switzerland Eran Yahav, Technion, Israel 2 Motivation Balanced Binary Search Tree (BST) is an efficient

  1. Verification-Friendly Concurrent Balanced Binary Search Tree Dana Drachsler, Technion, Israel Joint work with: Martin Vechev, ETH, Switzerland Eran Yahav, Technion, Israel

  2. 2 Motivation • Balanced Binary Search Tree (BST) is an efficient data-structure for storing unique elements ▫ No repetitions are allowed • Formal verification: ▫ Given a program, prove some property ▫ In the tree:  prove that repetitions of elements cannot occur

  3. 3 Motivation • Formal verification was applied to the sequential algorithm (e.g. using Isabelle [6]) • However, in a concurrent setting, formal verification is more complicated

  4. 4 Motivation • There seems to be a trade-off between algorithms that are easy to verify and algorithms that are practical • A concurrent BST that is protected by a global lock is easy to verify • Practical concurrent trees use sophisticated mechanisms ▫ Many different cases to reason about ▫ Harder to verify

  5. 5 Goal • We gap this trade-off by presenting a concurrent BST that is both practical and simple to reason about • Our key idea: ▫ Integrate the property into the algorithm • We achieve a fine-grained locking balanced BST • Our tree is very similar to the sequential tree • Our mechanism allows breaking the proof into several separated proofs

  6. 6 Outline Binary Search Balanced Binary Tree Search Tree Concurrent Concurrent Binary Balanced Binary Search Tree Search Tree

  7. 7 Binary Search Tree • A data-structure that stores elements • Consists of nodes 6 • Each node represents an element ▫ Internal tree 3 12 • Each element has a unique key ▫ Repetitions are not allowed 24 • Each node in the tree holds: ▫ The left sub-tree has elements with smaller keys ▫ The right sub-tree has elements with bigger keys

  8. 8 Binary Search Tree • In other words, BST maintains two types of invariants: ▫ Set invariant  Each key appears at most once ▫ BST invariants  For each node:  The keys in the left sub-tree are smaller  The keys in the right sub-tree are bigger

  9. 9 Binary Search Tree 24? • Supports the following operations: ▫ Contains 6 3 12 24

  10. 9 Binary Search Tree • Supports the following operations: ▫ Contains 6 3 12 24? 24

  11. 10 Binary Search Tree • Supports the following operations: ▫ Insert 6  The new node is always a leaf 3 12 24 9 24

  12. 10 Binary Search Tree • Supports the following operations: ▫ Insert 6  The new node is always a leaf 3 12 24 9

  13. 11 Binary Search Tree • Supports the following operations: ▫ Remove 6  The removed node, 𝑜 , may be:  A leaf  3 12 24 9

  14. 11 Binary Search Tree • Supports the following operations: ▫ Remove 6  The removed node, 𝑜 , may be:  A leaf 3 12 24

  15. 11 Binary Search Tree • Supports the following operations: ▫ Remove 6  The removed node, 𝑜 , may be:  A leaf  A parent of a single child 3 12 ▫ 𝑜 ’s parent is connected to 𝑜 ’s child 24 9 10

  16. 11 Binary Search Tree • Supports the following operations: ▫ Remove 6  The removed node, 𝑜 , may be:  A leaf  A parent of a single child 3 12 ▫ 𝑜 ’s parent is connected to 𝑜 ’s child 24 10

  17. 11 Binary Search Tree • Supports the following operations: ▫ Remove 6  The removed node, 𝑜 , may be:  A leaf  A parent of a single child 3 12 ▫ 𝑜 ’s parent is connected to 𝑜 ’s child  A parent of two children 24 10 ▫ 𝑜 ’s successor is relocated to 𝑜 ’s location

  18. 11 Binary Search Tree • Supports the following operations: ▫ Remove 10  The removed node, 𝑜 , may be:  A leaf  A parent of a single child 3 12 ▫ 𝑜 ’s parent is connected to 𝑜 ’s child  A parent of two children 24 ▫ 𝑜 ’s successor is relocated to 𝑜 ’s location

  19. 12 Outline Balanced Binary Search Tree Concurrent Concurrent Binary Balanced Binary Search Tree Search Tree

  20. 13 Challenges in Concurrent BST 9? • Consider the following tree: ▫ Thread A searches for 9 6 3 12 9

  21. 13 Challenges in Concurrent BST • Consider the following tree: ▫ Thread A searches for 9 6 and pauses 9? 3 12 9

  22. 13 Challenges in Concurrent BST • Consider the following tree: ▫ Thread A searches for 9 6 and pauses 9? ▫ Thread B removes 6 3 12 9

  23. 13 Challenges in Concurrent BST • Consider the following tree: ▫ Thread A searches for 9 9 and pauses 9? ▫ Thread B removes 6 3 12

  24. 13 Challenges in Concurrent BST • Consider the following tree: ▫ Thread A searches for 9 9 and pauses 9? ▫ Thread B removes 6 3 12 ▫ Thread A resumes the search

  25. 13 Challenges in Concurrent BST • Consider the following tree: ▫ Thread A searches for 9 9 and pauses ▫ Thread B removes 6 3 12 ▫ Thread A resumes the search and observes that 9 is not present 9?

  26. 14 How do others cope with this challenge? • By not supporting the remove operation ▫ Bender et al. [1]

  27. 15 How do others cope with this challenge? • By using external trees ▫ Only leaves can be removed 3 ▫ Use more space than internal trees ▫ Ellen et al. [4] 3 9 24 9

  28. 16 How do others cope with this challenge? • Many concurrent algorithms for data-structures remove elements in two steps: ▫ Marking the node as logically removed 6 3 12

  29. 16 How do others cope with this challenge? • Many concurrent algorithms for data-structures remove elements in two steps: ▫ Marking the node as logically removed 6 ▫ Update pointers to physically remove the node 3 12

  30. 17 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) 9? ▫ Also known as partially-external trees ▫ Bronson et al. [2] 6 ▫ Crain et al. [3] 3 12 9

  31. 17 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Also known as partially-external trees ▫ Bronson et al. [2] 6 ▫ Crain et al. [3] 9? 3 12 9

  32. 17 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Also known as partially-external trees B: ▫ Bronson et al. [2] remove(6) ▫ Crain et al. [3] 9? 3 12 9

  33. 17 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Also known as partially-external trees B: ▫ Bronson et al. [2] remove(6) ▫ Crain et al. [3] 3 12 9? 9

  34. 18 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) 9? ▫ Howley et al. [5] 6 3 12 9

  35. 18 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Howley et al. [5] 6 9? 3 12 9

  36. 18 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Howley et al. [5] B: remove(6) 6 9 9? 3 12

  37. 18 How do others cope with this challenge? • By marking the node as removed without A: physically removing it contains(9) ▫ Howley et al. [5] B: remove(6) 6 9 3 12 9?

  38. 19 How do others cope with this challenge? • These solutions leave removed nodes in the tree • Is it possible to physically remove nodes? • Trivial solution: use global lock 6 3 12 9

  39. 19 How do others cope with this challenge? • These solutions leave removed nodes in the tree • Is it possible to physically remove nodes? • Trivial solution: use global lock • Observation: To determine 6 7? whether 𝑙 is in the tree it is enough to have 𝑞, 𝑡 such that: 3 12 ▫ 𝑞, 𝑡 belong to the tree ▫ Any 𝑥 ∈ 𝑞, 𝑡 is not in the tree 9

  40. 20 Our Approach • Maintain the predecessor-successor relation ▫ The set layout • Consult this relation before making final decisions 6 3 12 9

  41. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) 9? • Consult this relation before making final decisions 6 3 12 9

  42. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) • Consult this relation before making final decisions 6 9? 3 12 9

  43. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) • Consult this relation before B: making final decisions remove(6) 9 9? 3 12

  44. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) • Consult this relation before B: making final decisions remove(6) 9 3 12 9?

  45. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) • Consult this relation before B: making final decisions remove(6) 9 9? 3 12

  46. 20 Our Approach • Maintain the predecessor-successor relation A: ▫ The set layout contains(9) • Consult this relation before B: making final decisions remove(6) 9 9? • This relation allows us to lock the required nodes even if they 3 12 are not adjacent ▫ Enjoy the benefits of the global lock ▫ While enabling more parallelism

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Balanced Search Trees Binary Search Trees Binary Search Tree Binary Search Tree A binary tree is

Balanced Search Trees Binary Search Trees Binary Search Tree Binary Search Tree A binary tree is

Balanced Search Trees Binary Search Trees Binary Search Tree Binary Search Tree A binary tree is a binary search tree if each element in the left subtree is smaller than the root, each element in the right subtree is larger than the root,

757 views • 51 slides
Binary Search Trees and Balanced Binary Search Trees using AVL Trees Mark Redekopp David Kempe

Binary Search Trees and Balanced Binary Search Trees using AVL Trees Mark Redekopp David Kempe

1 CSCI 104 Binary Search Trees and Balanced Binary Search Trees using AVL Trees Mark Redekopp David Kempe Sandra Batista 2 Properties, Insertion and Removal BINARY SEARCH TREES 3 Binary Search Tree Binary search tree = binary tree

630 views • 61 slides
How efficient are binary search trees? Balanced search trees Balancing a tree means to keep the

How efficient are binary search trees? Balanced search trees Balancing a tree means to keep the

CS206 CS206 How efficient are binary search trees? Balanced search trees Balancing a tree means to keep the left and right subtree of Binary search tree operations take time O ( h ) , where h is the every node of roughly equal size.

200 views • 3 slides
Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the

Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the

Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the Indexed AVL trees number of elements in the tree Indexed red-black trees AVL (Adelson-Velsky and Landis) Indexed operations also

253 views • 6 slides
Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the

Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the

Balanced Binary Search Trees Balanced Binary Search Trees height is O(log n), where n is the Indexed AVL trees number of elements in the tree Indexed red-black trees AVL (Adelson-Velsky and Landis) Indexed operations also

297 views • 8 slides
Definitions Binary Search Tree: n Tree: hierarchical structure made of nodes with father-son

Definitions Binary Search Tree: n Tree: hierarchical structure made of nodes with father-son

Advanced Programming Binary Search Tree Binary Search Tree Introduction Binary Search Tree, o BST implement dictionaries or ordered queues elements stored are ordered according to a key Efficient (log n) operations S EARCH , M INIMUM , M

362 views • 32 slides
Red-Black Trees ! Motivation: a binary search tree that is guaranteed to be balanced (operations

Red-Black Trees ! Motivation: a binary search tree that is guaranteed to be balanced (operations

Red-Black Trees ! Motivation: a binary search tree that is guaranteed to be balanced (operations take time in the ( ) O lg n worst-case). Red-Black Trees ! A red-black tree is a binary search tree where each node has a color

259 views • 4 slides
Balanced Binary Search Trees height is O(log n), where n is the number of elements in the

Balanced Binary Search Trees height is O(log n), where n is the number of elements in the

Balanced Binary Search Trees height is O(log n), where n is the number of elements in the tree AVL (Adelson-Velsky and Landis) trees red-black trees get, put, and remove take O(log n) time Balanced Binary Search Trees

533 views • 16 slides
Binary Search Trees A binary search tree is a binary tree T such that - each internal node

Binary Search Trees A binary search tree is a binary tree T such that - each internal node

AVL T REES Binary Search Trees AVL Trees AVL Trees 1 Binary Search Trees A binary search tree is a binary tree T such that - each internal node stores an item (k, e) of a dictionary. - keys stored at nodes in the left subtree of

547 views • 26 slides
The problem with binary search trees Height-balanced trees AVL trees Search time average case:

The problem with binary search trees Height-balanced trees AVL trees Search time average case:

The problem with binary search trees Height-balanced trees AVL trees Search time average case: lg( n ) Tyler Moore Search time worst case: n Can you construct such a tree? CS 2123, The University of Tulsa Solution: height-balanced binary trees

212 views • 4 slides
Balanced Binary Search Tree Algorithm : Design & Analysis [8] In the last class

Balanced Binary Search Tree Algorithm : Design & Analysis [8] In the last class

Balanced Binary Search Tree Algorithm : Design & Analysis [8] In the last class Finding max and min Finding the second largest key Adversary argument and lower bound Selection Problem Median A Linear Time Selection

465 views • 33 slides
Data Structures Balanced Binary Search Tree Virendra Singh Associate Professor Computer

Data Structures Balanced Binary Search Tree Virendra Singh Associate Professor Computer

Data Structures Balanced Binary Search Tree Virendra Singh Associate Professor Computer Architecture and Dependable Systems Lab Department of Electrical Engineering Indian Institute of Technology Bombay http://www.ee.iitb.ac.in/~viren/

911 views • 48 slides
Advanced Implementations of Tables: Balanced Search Trees and Hashing Balanced Search Trees

Advanced Implementations of Tables: Balanced Search Trees and Hashing Balanced Search Trees

Advanced Implementations of Tables: Balanced Search Trees and Hashing Balanced Search Trees Binary search tree operations such as insert, delete, retrieve, etc. depend on the length of the path to the desired node The path length can

721 views • 59 slides
Objectives Memahami variant dari Binary Search Tree yang balanced Struktur Data &

Objectives Memahami variant dari Binary Search Tree yang balanced Struktur Data &

Objectives Memahami variant dari Binary Search Tree yang balanced Struktur Data & Algoritme ( Data Structures & Algorithms ) AVL Tree Denny ( denny@cs.ui.ac.id ) Suryana Setiawan ( setiawan@cs.ui.ac.id ) Fakultas I lm u Kom puter

119 views • 11 slides
Binary search trees Dictionary ADT Binary search tree properties Search Insertion February 04,

Binary search trees Dictionary ADT Binary search tree properties Search Insertion February 04,

Binary search trees Dictionary ADT Binary search tree properties Search Insertion February 04, 2019 Cinda Heeren / Will Evans / Geoffrey Tien 1 By the way... Here is a reference to the "three dots" tree traversal shown in

602 views • 17 slides
AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17

AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17

1 8 6 z 4 3 v AVL Trees AVL Trees AVL Tree Definition (9.2) AVL trees are 4 44 balanced. 2 3 An AVL Tree is a 17 78 binary search tree 1 2 1 88 32 50 such that for every 1 1 internal node v of T, 48 62 the heights of

453 views • 9 slides
Single Rotation k2 k1 k1 k2 h Z X X Y Y Z New item Suppose an item is added at the

Single Rotation k2 k1 k1 k2 h Z X X Y Y Z New item Suppose an item is added at the

Single Rotation k2 k1 k1 k2 h Z X X Y Y Z New item Suppose an item is added at the bottom of subtree X, thus causing an imbalance at k2. Then pull k1 up. Note that after the rotation, the height of the tree is the same as it was

702 views • 53 slides
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Binary Search Trees CLRS

COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Binary Search Trees CLRS

COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Binary Search Trees CLRS 12.2, 12.3, 13.2, read problem 13-3 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 45 Dictionaries

2.14k views • 127 slides
Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees,

Trees Eric McCreath Overview In this lecture we will explore: general trees, binary trees, binary search trees, and AVL and B-Trees. 2 Trees Trees are recursive data structures. They are useful for: representing items that have a tree

622 views • 27 slides
Relativistic Red-Black Trees Philip W. Howard, Jonathan Walpole, October 2013. Presented by

Relativistic Red-Black Trees Philip W. Howard, Jonathan Walpole, October 2013. Presented by

Relativistic Red-Black Trees Philip W. Howard, Jonathan Walpole, October 2013. Presented by Kendall Stewart CS510 Concurrent Systems, Spring 2014 The Story so Far Locking is slow Non-blocking algorithms are complicated Memory

1.47k views • 36 slides
X Y Z is for Compsci 201 More on Trees and Computer Science XOR (A || B) &&

X Y Z is for Compsci 201 More on Trees and Computer Science XOR (A || B) &&

X Y Z is for Compsci 201 More on Trees and Computer Science XOR (A || B) && !(A && B) aka A^B Part 1 of 4 XML Extensible Markup Language Yesterday's JSON Y-Combinator https://www.ycombinator.com/

407 views • 20 slides
CPL 2016, week 11 Clojure immutable data structures Oleg Batrashev Institute of Computer

CPL 2016, week 11 Clojure immutable data structures Oleg Batrashev Institute of Computer

CPL 2016, week 11 Clojure immutable data structures Oleg Batrashev Institute of Computer Science, Tartu, Estonia April 25, 2016 Overview Last week Clojure language core This week Immutable data structures Next weeks Clojure

507 views • 39 slides
Optimal Finger Search Trees in the Pointer Machine Gerth Stlting Brodal BRICS University of

Optimal Finger Search Trees in the Pointer Machine Gerth Stlting Brodal BRICS University of

Optimal Finger Search Trees in the Pointer Machine Gerth Stlting Brodal BRICS University of Aarhus George Lagogiannis Christos Makris Athanasios Tsakalidis Kostas Tsichlas University of Patras Dagstuhl seminar on Data Structures,

322 views • 16 slides
CIS 218 Advanced UNIX (g)awk CIS 218 Advanced UNIX 1 Overview awk is a programming

CIS 218 Advanced UNIX (g)awk CIS 218 Advanced UNIX 1 Overview awk is a programming

CIS 218 Advanced UNIX (g)awk CIS 218 Advanced UNIX 1 Overview awk is a programming language Awk uses syntax based on grep and sed for handling numbers and text awk provides field level addressability. And within a field (word)

662 views • 40 slides

More recommend