Sökning: "distributed data structures"

Visar resultat 1 - 5 av 99 avhandlingar innehållade orden distributed data structures.

  1. 1. Distributed k-ary System: Algorithms for Distributed Hash Tables

    Författare :Ali Ghodsi; Seif Haridi; Alexander Reinefeld; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; distributed hash tables; structured overlay networks; distributed algorithms; distributed systems; group communication; replication; Computer science; Datavetenskap;

    Sammanfattning : This dissertation presents algorithms for data structures called distributed hash tables (DHT) or structured overlay networks, which are used to build scalable self-managing distributed systems. The provided algorithms guarantee lookup consistency in the presence of dynamism: they guarantee consistent lookup results in the presence of nodes joining and leaving. LÄS MER

  3. 2. Reactive Concurrent Data Structures and Algorithms for Synchronization

    Författare :Phuong Ha; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; non-blocking; reactive; multi-word atomic primitives; online algorithms; shared memory; concurrent data structures; distributed data structures; randomization; online financial problems; synchronization; spin-locks;

    Sammanfattning : Parallelism plays a significant role in high-performance computing systems, from large clusters of computers to chip-multithreading (CMT) processors. Performance of the parallel systems comes not only from concurrently runningmore processing hardware but also from utilizing the hardware efficiently. LÄS MER

  4. 3. Distributed connectivity algorithms

    Författare :Esther Jennings; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : The goal of this research is to design efficient distributed algorithms which execute on an arbitrary network to recognize special connectivity structures within that network. In some cases, we also consider the maintenance of these special structures in dynamically changing networks. LÄS MER

  5. 4. Fault tolerant control in flexible manufacturing systems

    Författare :Torbjörn Andréasson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; fault tolerant systems; distributed computing; factory automation; configuration; algorithms; flexible manufacturing systems FMS ; general recursiva system GRS ; computer intergrated manufacturing CIM ; data structures;

    Sammanfattning : .... LÄS MER

  7. 5. Applications of Non-Blocking Data Structures to Real-Time Systems

    Författare :Håkan Sundell; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; shared memory; wait-free; snapshot; real-time; synchronisation; lock-free; timing information; non-blocking;

    Sammanfattning : This thesis is a major part of the results within a project called "Applications of wait/lock-free protocols to real-time systems". This project is funded by the national Swedish Real-Time Systems research initiative ARTES (www.artes.uu. LÄS MER