Results 251 to 260 of about 119,472 (328)

Latency, Capacity, and Distributed Minimum Spanning Tree

open access: closed2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS), 2020
We study the cost of distributed MST construction in the setting where each edge has a latency and a capacity, along with the weight. Edge latencies capture the delay on the links of the communication network, while capacity captures their throughput (the rate at which messages can be sent).
John Augustine   +4 more
semanticscholar   +5 more sources

Distributed minimum spanning tree differential evolution for multimodal optimization problems

open access: closedSoft Computing, 2019
Multimodal optimization problem (MMOP) requires to find optima as many as possible for a single problem. Recently, many niching techniques have been proposed to tackle MMOPs. However, most of the niching techniques are either sensitive to the niching parameters or causing a waste of fitness evaluations.
Zijia Wang, Zhi‐Hui Zhan, Jun Zhang
semanticscholar   +4 more sources

Distributed Minimum Spanning Tree Maintenance for Transient Node Failures [PDF]

open access: possibleIEEE Transactions on Computers, 2012
In many network applications, the computation takes place on the minimum-cost spanning tree (MST) of the network G; unfortunately, a single link or node failure disconnects the tree. The ALL NODES REPLACEMENT (ANR) problem is the problem of precomputing, for each node u in G, the new MST should u fail. This problem has been extensively investigated for
P. FLOCCHINI   +4 more
openaire   +3 more sources

A sub-linear time distributed algorithm for minimum-weight spanning trees [PDF]

open access: closedProceedings of 1993 IEEE 34th Annual Foundations of Computer Science, 2002
This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network.
Juan A. Garay, Shay Kutten, David Peleg
openalex   +3 more sources

Distributed minimum spanning tree based information exchange policy for distributed systems

2016 Fourth International Conference on Parallel, Distributed and Grid Computing (PDGC), 2016
Distributed system has an inherent problem of unevenly distributed load. The possible solution to this problem is load balancing. For the above purpose it is very important to have updated information about the load status of the nodes comprising the system.
Taj Alam, Zahid Raza
openaire   +3 more sources

Triggered Minimum Spanning Tree for distributed coverage with connectivity maintenance

2014 European Control Conference (ECC), 2014
We study the problem of distributed coverage with connectivity maintenance for robot networks with range-limited communication and sensing.We let the robots perform coverage while keeping a set of communication links. The structure that ensures that the network does not get disconnected, and that provides the highest freedom of robot motions is the ...
Youcef Mezouar   +2 more
openaire   +3 more sources

A Distributed Algorithm for Minimum Weight Spanning Trees. Revision

open access: closed, 1979
Abstract : A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange messages with neighbors until the tree is
Robert G. Gallager   +2 more
openalex   +2 more sources

Implementation of an Algorithm for Minimum Spanning Tree in a Distributed Environment [PDF]

open access: possible, 2014
High performance computing and its applications are innumerable and the fact that it has seen a tremendous change in the recent years has given it the chance of becoming the future of computing world. The growing need for computational speed has made parallel processing as a must for every sphere of computation.
Motahar Reza   +3 more
openaire   +2 more sources

Optimal cost-sensitive distributed minimum spanning tree algorithm

Scandinavian Workshop on Algorithm Theory, 1996
In a network of asynchronous processors, the cost to send a message can differ significantly from one communication link to another. Assume that associated with each link is a positive weight representing the cost of sending one message along the link and the cost of an algorithm executed on a weighted network is the sum of the costs of all messages ...
Lisa Higham, Teresa M. Przytycka
openaire   +3 more sources

Home - About - Disclaimer - Privacy