Search for dissertations about: "Linearizability"

Showing result 1 - 5 of 6 swedish dissertations containing the word Linearizability.

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

   Author : Cosmin Ionel Arad; Seif Haridi; Gregory Chockler; KTH; []
   Keywords : 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;

   Abstract : 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. READ MORE

4. 2. Lock-free Concurrent Search

   Author : Bapi Chatterjee; Chalmers tekniska högskola; []
   Keywords : 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;

   Abstract : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. READ MORE

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

   Author : Shafaat Tallat Mahmood; Seif Haridi; Peter Van Roy; KTH; []
   Keywords : 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;

   Abstract : 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. READ MORE

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

   Author : Kjell Winblad; Konstantinos Sagonas; Erez Petrank; Uppsala universitet; []
   Keywords : 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;

   Abstract : 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. READ MORE

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

   Author : Maria Saprykina; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Ergodicity; weak mixing; Hamiltonian systems; MATHEMATICS; MATEMATIK;

   Abstract : .... READ MORE