Sökning: "Amortized Complexity"

Hittade 4 avhandlingar innehållade orden Amortized Complexity.

  1. 1. Lock-free Concurrent Search

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Bapi Chatterjee; [2017]
    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

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

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Bapi Chatterjee; [2015]
    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

  3. 3. Dynamic algorithms: new worst-case and instance-optimal bounds via new connections

    Detta är en avhandling från KTH Royal Institute of Technology

    Författare :Thatchaphol Saranurak; KTH.; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computer Science;

    Sammanfattning : This thesis studies a series of questions about dynamic algorithms which are algorithms for quickly maintaining some information of an input data undergoing a sequence of updates. The first question asks \emph{how small the update time for handling each update can be} for each dynamic problem. LÄS MER

  4. 4. On Design and Applications of Practical Concurrent Data Structures

    Detta är en avhandling från ; Chalmers tekniska högskola; Gothenburg

    Författare :Ivan Walulya; [2018]
    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