Sökning: "distributed data structures"
Visar resultat 1 - 5 av 98 avhandlingar innehållade orden distributed data structures.
1. Reactive Concurrent Data Structures and Algorithms for Synchronization
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
2. Distributed k-ary System: Algorithms for Distributed Hash Tables
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. Distributed connectivity algorithms
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
4. Fault tolerant control in flexible manufacturing systems
Sammanfattning : .... LÄS MER
5. Applications of Non-Blocking Data Structures to Real-Time Systems
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