Distributed algorithm

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

An algorithm for distributed groupware applications

Abstract: Computer supported cooperative work (CSCW) is a rapidly growing field. Real-time groupware systems are addressed that allow a group of users to edit a shared document. The architecture and concurrency control algorithm used in this system are described. The algorithm is based on the semantics of the application and can be used by the developers of other groupware systems. The authors begin by introducing the notion of a purely replicated architecture and then present GroupDesign, a shared drawing tool implemented with this architecture. They then present the main parts of the algorithm that implement the distribution. The algorithm gives the best response time for the interface and reduces the number of undo and redo operations when conflicts occur. >

Distributed coordination algorithms for mobile robot swarms: new directions and challenges

Abstract: Recently there have been a number of efforts to study issues related to coordination and control algorithms for systems of multiple autonomous mobile robots (also known as robot swarms) from the viewpoint of distributed computing. This paper reviews the literature in the area and discusses some open problems and future research directions.

Distributed Routing Algorithms for Underwater Acoustic Sensor Networks

Abstract: Underwater Acoustic Sensor Networks (UW-ASNs) consist of devices with sensing, processing, and communication capabilities that are deployed underwater to perform collaborative monitoring tasks to support a broad range of applications. The enabling communication technology for distances over one hundred meters is wireless acoustic networking because of the high attenuation and scattering affecting radio and optical waves, respectively. In this work, the problem of data gathering is investigated by considering the interactions between the routing functions and the characteristics of the underwater acoustic channel. Two distributed geographical routing algorithms for delay-insensitive and delay-sensitive applications are proposed and shown through simulation experiments to meet the application requirements.

Algorithmic mechanism design for load balancing in distributed systems

Abstract: Computational grids are promising next-generation computing platforms for large-scale problems in science and engineering. Grids are large-scale computing systems composed of geographically distributed resources (computers, storage etc.) owned by self interested agents or organizations. These agents may manipulate the resource allocation algorithm in their own benefit, and their selfish behavior may lead to severe performance degradation and poor efficiency. In this paper, we investigate the problem of designing protocols for resource allocation involving selfish agents. Solving this kind of problems is the object of mechanism design theory. Using this theory, we design a truthful mechanism for solving the static load balancing problem in heterogeneous distributed systems. We prove that using the optimal allocation algorithm the output function admits a truthful payment scheme satisfying voluntary participation. We derive a protocol that implements our mechanism and present experiments to show its effectiveness.