Sökning: "Linearizability"

Visar resultat 1 - 5 av 6 avhandlingar innehållade ordet Linearizability.

  1. 1. Programming Model and Protocols for Reconfigurable Distributed Systems

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

    Författare :Cosmin Ionel Arad; KTH.; SICS.; [2013]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; distributed systems; programming model; message-passing concurrency; nested hierarchical composition; reactive components; software architecture; dynamic reconfiguration; multi-core; discrete-event simulation; peer-to-peer; testing; debugging; distributed key-value stores; data replication; consistency; linearizability; network partition tolerance; consistent hashing; self-organization; scalability; elasticity; fault tolerance; consistent quorums;

    Sammanfattning : Distributed systems are everywhere. From large datacenters to mobile devices, an ever richer assortment of applications and services relies on distributed systems, infrastructure, and protocols. Despite their ubiquity, testing and debugging distributed systems remains notoriously hard. LÄS MER

  2. 2. 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

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

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

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

    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

  4. 4. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Kjell Winblad; Uppsala universitet.; Uppsala universitet.; [2018]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; concurrent data structures; contention adapting; range queries; lock-freedom; adaptivity; linearizability; ordered sets; maps; key-value stores; concurrent priority queues; relaxed concurrent data structures; locks; delegation locking; Computer Science; Datavetenskap;

    Sammanfattning : The multicore revolution means that programmers have many cores at their disposal in everything from phones to large server systems. Concurrent data structures are needed to make good use of all the cores. Designing a concurrent data structure that performs well across many different scenarios is a difficult task. LÄS MER

  5. 5. Non-linearizability, unique ergodicity and weak mixing in dynamics

    Detta är en avhandling från Stockholm : KTH

    Författare :Maria Saprykina; KTH.; [2003]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Ergodicity; weak mixing; Hamiltonian systems; MATHEMATICS; MATEMATIK;

    Sammanfattning : .... LÄS MER