Search for dissertations about: "Key-Value Stores"

Found 4 swedish dissertations containing the words Key-Value Stores.

  1. 1. Self-Management for Large-Scale Distributed Systems

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Ahmad Al-Shishtawy; KTH.; Computer Systems Laboratory.; [2012]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; SRA - ICT; SRA - Informations- och kommunikationsteknik; Self-Management; Autonomic Computing; Control Theory; Distributed Systems; Grid Computing; Cloud Computing; Elastic Services; Key-Value Stores;

    Abstract : Autonomic computing aims at making computing systems self-managing by using autonomic managers in order to reduce obstacles caused by management complexity. This thesis presents results of research on self-management for large-scale distributed systems. READ MORE

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

    University dissertation from Uppsala : Acta Universitatis Upsaliensis

    Author : Kjell Winblad; Uppsala universitet.; Uppsala universitet.; [2018]
    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

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

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Cosmin Ionel Arad; KTH.; SICS.; [2013]
    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. 4. Partition Tolerance and Data Consistency in Structured Overlay Networks

    University dissertation from Stockholm : KTH Royal Institute of Technology

    Author : Shafaat Tallat Mahmood; Tallat M. Shafaat; KTH.; Computer Systems Laboratory.; [2013]
    Keywords : 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.;

    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