Sökning: "Binary Search Tree"

Visar resultat 1 - 5 av 10 avhandlingar innehållade orden Binary Search Tree.

  1. 1. Lock-free Concurrent Search

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Wait-free; Help-aware; Non-blocking; Concurrency; Linearizability; Lock-based; Lock-free-kD-tree; Amortized Complexity; Data Structure; Binary Search Tree; Blocking; Search; Concurrent; kD-tree; Linked-list; Lock-free; Range Search; Language-portable; Help-optimal; Nearest Neighbour Search; Linearizable; Synchronization;

    Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER

  3. 2. Split Trees, Cuttings and Explosions

    Författare :Cecilia Holmgren; Svante Janson; Luc Devroye; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random Graphs; Random Trees; Split Trees; Renewal Theory; Binary Search Trees; Cuttings; Records; Tree Algorithms; Markov Chains; Galton-Watson Processes; MATHEMATICS; MATEMATIK; Mathematics; Matematik;

    Sammanfattning : This thesis is based on four papers investigating properties of split trees and also introducing new methods for studying such trees. Split trees comprise a large class of random trees of logarithmic height and include e.g., binary search trees, m-ary search trees, quadtrees, median of (2k+1)-trees, simplex trees, tries and digital search trees. LÄS MER

  4. 3. Efficient Implementation of Concurrent Data Structures on Multi-core and Many-core Architectures

    Författare :Bapi Chatterjee; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Synchronization Primitives; Lock-free Binary search tree; Lock-free; Concurrent Data Structures;

    Sammanfattning : Synchronization of concurrent threads is the central problem in order to design efficient concurrent data-structures. The compute systems widely available in market are increasingly becoming heterogeneous involving multi-core Central Processing Units (CPUs) and many-core Graphics Processing Units (GPUs). LÄS MER

  5. 4. Parallel algorithms for solving the train timetable rescheduling problem

    Författare :Sai Prashanth Josyula; Johanna Törnquist Krasemann; Lars Lundberg; Blekinge Tekniska Högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Parallel computing; Parallel heuristic search algorithms; Computer Science; Datavetenskap;

    Sammanfattning : In railways, it is essential to achieve high train punctuality. Thus, whenever disturbances occur, it is important to reschedule the trains effectively. This task is typically handled manually by traffic controllers in real-time. LÄS MER

  7. 5. On Design and Applications of Practical Concurrent Data Structures

    Författare :Ivan Walulya; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; combining; multicore; stream processing; atomicity; concurrent data structures; non-blocking; synchronization; lock-free; locking;

    Sammanfattning : The proliferation of multicore processors is having an enormous impact on software design and development. In order to exploit parallelism available in multicores, there is a need to design and implement abstractions that programmers can use for general purpose applications development. LÄS MER