Sökning: "Linearizability"
Visar resultat 1 - 5 av 6 avhandlingar innehållade ordet Linearizability.
1. Programming Model and Protocols for Reconfigurable Distributed Systems
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. Lock-free Concurrent Search
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. Partition Tolerance and Data Consistency in Structured Overlay Networks
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. Dynamic Adaptations of Synchronization Granularity in Concurrent Data Structures
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. Non-linearizability, unique ergodicity and weak mixing in dynamics
Sammanfattning : .... LÄS MER