Sökning: "Distributed Algorithms"

Visar resultat 1 - 5 av 299 avhandlingar innehållade orden Distributed Algorithms.

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. 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

4. 3. Asynchronous Algorithms for Large-Scale Optimization : Analysis and Implementation

   Författare :Arda Aytekin; Mikael Johansson; Panagiotis K. Patrinos; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex optimization; optimization; asynchronous algorithms; algorithms; parallel algorithms; large-scale; big data; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : This thesis proposes and analyzes several first-order methods for convex optimization, designed for parallel implementation in shared and distributed memory architectures. The theoretical focus is on designing algorithms that can run asynchronously, allowing computing nodes to execute their tasks with stale information without jeopardizing convergence to the optimal solution. LÄS MER

5. 4. Distributed Optimization and Control : Primal--Dual, Online, and Event-Triggered Algorithms

   Författare :Xinlei Yi; Karl H. Johansson; Dimos V. Dimarogonas; John S. Baras; Antonis Papachristodoulou; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Distributed nonconvex optimization; distributed online convex optimization; distributed event-triggered control; primal-dual algorithm; stochastic gradient descent; zeroth-order algorithm; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : In distributed optimization and control, each network node performs local computation based on its own information and information received from its neighbors through a communication network to achieve a global objective. Although many distributed optimization and control algorithms have been proposed, core theoretical problems with important practical relevance remain. LÄS MER

7. 5. Asynchronous First-Order Algorithms for Large-Scale Optimization : Analysis and Implementation

   Författare :Arda Aytekin; Mikael Johansson; Lin Xiao; KTH; []
   Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; convex; optimization; asynchronous; algorithms; parallel; distributed; large-scale; big data; software; serverless; Electrical Engineering; Elektro- och systemteknik;

   Sammanfattning : Developments in communication and data storage technologies have made large-scale data collection more accessible than ever. The transformation of this data into insight or decisions typically involves solving numerical optimization problems. LÄS MER