scispace - formally typeset
Search or ask a question
Topic

Distributed algorithm

About: Distributed algorithm is a research topic. Over the lifetime, 20416 publications have been published within this topic receiving 548109 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the authors consider the problem of wake-up all n processors of a completely connected broadcast system in both the globally synchronous and locally synchronous models with or without the assumption that n is known to the processors.
Abstract: This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple-access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually when the processor wakes up. We consider the fundamental problem of waking up all n processors of a completely connected broadcast system. Some processors wake up spontaneously, while others have to be woken up. Only awake processors can send messages; a sleeping processor is woken up upon hearing a message. The processors hear a message in a given round if and only if exactly one processor sends a message in that round. Our goal is to wake up all processors as fast as possible in the worst case, assuming an adversary controls which processors wake up and when. We analyze the problem in both the globally synchronous and locally synchronous models with or without the assumption that n is known to the processors. We propose randomized and deterministic algorithms for the problem, as well as lower bounds in some of the cases. These bounds establish a gap between the globally synchronous and locally synchronous models.

121 citations

Journal ArticleDOI
TL;DR: It is formally proved that independently of the shape and dimensions of the planar topologies and of the number and placement of the TSVs, the proposed routing algorithm using two virtual channels in the plane is deadlock and livelock free.
Abstract: In this paper, we propose a distributed routing algorithm for vertically partially connected regular 2D topologies of different shapes and sizes (e.g., 2D mesh, torus, ring). The topologies that are the target of this algorithm are of practical interest in the 3D integration of heterogeneous dies using Through-Silicon-Vias (TSVs). Indeed, TSV-based 3D integration allows to envision the stacking of dies with different functions and technologies, using as an interconnect backbone a 3D-NoC. Intrinsically, 3D topologies have better performances, but yield and active area (and thus the cost) are function of the number of TSVs; therefore, the designs tend to use only a subset of available TSVs between two dies. The definition of blockage free and low implementation cost distributed deterministic routing on this kind of topology is thus of theoretical and practical interests. We formally prove that independently of the shape and dimensions of the planar topologies and of the number and placement of the TSVs, the proposed routing algorithm using two virtual channels in the plane is deadlock and livelock free. We also experimentally show that the performance of this algorithm is still acceptable when the number of vertical connections decreases.

121 citations

Proceedings ArticleDOI
01 May 2007
TL;DR: A generic randomized routing, scheduling and flow control scheme that is applicable to a large class of interference models, and that allows for the development of distributed algorithms which maximize network throughput and utilization is described.
Abstract: In this paper, we provide and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In particular, we describe a generic randomized routing, scheduling and flow control scheme that is applicable to a large class of interference models, and that allows for the development of distributed algorithms which maximize network throughput and utilization. In particular, we focus on a specific interference model, namely the secondary interference model, and develop distributed algorithms with polynomial communication and computation complexity in the network size. This is an important result given that earlier throughput-optimal algorithms developed for such a model relies on the solution to an NP-hard problem. This results in a polynomial complexity cross-layer algorithm that achieves throughput optimality and fair allocation of network resources amongst the users. We further show that our algorithmic approach enables us to efficiently approximate the capacity region of a multi-hop wireless network.

121 citations

Journal ArticleDOI
TL;DR: Analytical and experimental results are provided that verify the effectiveness of the proposed architecture for generation control in islanded microgrids, and illustrate the performance of the aforementioned distributed algorithms under a variety of scenarios.
Abstract: In this paper, we propose a distributed architecture for generation control in islanded ac microgrids with both synchronous generators and inverter-interfaced power supplies. Although they are smaller and have lower ratings, the generation control objectives for an islanded microgrid are similar to those in large power systems, e.g., bulk power transmission networks; specifically, without violating limits on generator power output, frequency must be regulated and generation costs should be minimized. However, in large power systems, the implementation of the generation control functions is centralized, i.e., there is a computer that resides in a centralized location, e.g., a control center, with measurements and control signals telemetered between the generating units and the centrally located computer. The architecture for generation control that we propose in this paper does not rely on such a centrally located computer. Instead, the implementation of the control functions is distributed and relies on iterative algorithms that combine local measurements and certain information acquired from neighboring generating units with local, low-complexity computations. We provide analytical and experimental results that verify the effectiveness of the proposed architecture for generation control in islanded microgrids, and illustrate the performance of the aforementioned distributed algorithms under a variety of scenarios.

121 citations

Journal Article
TL;DR: In this article, the authors present the problems that arise when attempting to utilize the theoretical coalition formation algorithms for a real-world system, demonstrate how some of their restrictive assumptions can be relaxed, and discuss the resulting benefits.
Abstract: Incorporating coalition formation algorithms into agent systems shall be advantageous due to the consequent increase in the overall quality of task performance. Coalition formation was addressed in game theory, however the game theoretic approach is centralized and computationally intractable. Recent work in DAI has resulted in distributed algorithms with computational tractability. This paper addresses the implementation of distributed coalition formation algorithms within a real-world multi-agent system. We present the problems that arise when attempting to utilize the theoretical coalition formation algorithms for a real-world system, demonstrate how some of their restrictive assumptions can be relaxed, and discuss the resulting benefits. In addition, we analyze the modifications, the complexity and the quality of the cooperation mechanisms. The task domain of our multi-agent system is information gathering, filtering and decision support within the WWW.

121 citations


Network Information
Related Topics (5)
Server
79.5K papers, 1.4M citations
94% related
Scheduling (computing)
78.6K papers, 1.3M citations
91% related
Network packet
159.7K papers, 2.2M citations
91% related
Wireless network
122.5K papers, 2.1M citations
91% related
Wireless sensor network
142K papers, 2.4M citations
89% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202381
2022135
2021583
2020759
2019876
2018845