Sökning: "Linearizable"

Visar resultat 1 - 5 av 7 avhandlingar innehållade ordet Linearizable.

  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. Painlevé analysis and transformations for nonlinear partial differential equations

    Författare :Ove Lindblom; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Matematik;

    Sammanfattning : Nonlinear partial differential equations play a fundamental role in the description of many physical models. In order to get a complete understanding of the phenomena which are modeled it is important to obtain exact analytic solutions. LÄS MER

  4. 3. Partition Tolerance and Data Consistency in Structured Overlay Networks

    Författare :Shafaat Tallat Mahmood; Seif Haridi; Peter Van Roy; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Structured overlay networks; distributed Hash tables; network partitions and mergers; size estimation; lookup inconsistencies; distributed key-value stores; linearizability; dynamic reconfiguration; replication.; SRA - ICT; SRA - Informations- och kommunikationsteknik;

    Sammanfattning : Structured overlay networks form a major class of peer-to-peer systems, which are used to build scalable, fault-tolerant and self-managing distributed applications. This thesis presents algorithms for structured overlay networks, on the routing and data level, in the presence of network and node dynamism. LÄS MER

  5. 4. 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

  7. 5. Principles for planning and analyzing motions of underactuated mechanical systems and redundant manipulators

    Författare :Uwe Mettin; Anton Shiriaev; Alin Albu-Schäffer; Umeå universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Motion Planning; Underactuated Mechanical Systems; Redundant Manipulators; Virtual Holonomic Constraints; Orbital Stabilization; Human Movement; Walking Robots; Hydraulic Manipulators; Electrical engineering; Elektroteknik; Automatic Control; reglerteknik;

    Sammanfattning : Motion planning and control synthesis are challenging problems for underactuated mechanical systems due to the presence of passive (non-actuated) degrees of freedom. For those systems that are additionally not feedback linearizable and with unstable internal dynamics there are no generic methods for planning trajectories and their feedback stabilization. LÄS MER