Results 281 to 290 of about 308,840 (315)

Monitoring distributed systems with distributed algorithms

Proceedings of the 41st IEEE Conference on Decision and Control, 2002., 2003
Proposes a framework to process large distributed systems by parts, through distributed algorithms. We consider distributed (discrete event) systems as the combination of elementary components. Each component defines dynamics on several state variables, and the composition is simply defined by sharing variables.
Eric Fabre, Vincent Pigourier
openaire   +1 more source

A distributed deadlock detection algorithm: Distributed graph reconstruction algorithm

Information Processing Letters, 1989
A new algorithm for the distributed deadlock detection problem in the communication model of a distributed system is described. The new algorithm is called distributed graph reconstruction (DGR) algorithm. To represent the state of the system, a Wait-For-Graph is used. Doing the reconstruction of the Wait-For-Graph a cycle can be detected in the graph.
SONG, GY, PARK, DY, LEE, DM, PARK, KH Park, Kyu Ho, KIM, MW   +4 more
openaire   +2 more sources

Algorithm visualization for distributed environments

Proceedings IEEE Symposium on Information Visualization (Cat. No.98TB100258), 2002
Abstract This paper investigates the visualization of distributed algorithms. We present a conceptual model and a system, VADE, that realizes this model. Since in asynchronous distributed systems there is no way of knowing (let alone, visualizing) the “real” execution, we show how to generate a visualization which is consistent with the execution of ...
Yoram Moses, Zvi Polunsky, Ayellet Tal, Leonid Ulitsky   +3 more
openaire   +1 more source

Coordination Algorithm for Distributed Testing

The Journal of Supercomputing, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Omar Rafiq, Leo Cacciari
openaire   +1 more source

Stability and distributed scheduling algorithms

Proceedings of the 1985 ACM thirteenth annual conference on Computer Science - CSC '85, 1985
Many distributed scheduling algorithms have been developed and reported in the current literature. However, very few of them explicitly treat stability issues. This paper first discusses stability issues for distributed scheduling algorithms in general terms.
openaire   +1 more source

Distributed Algorithms For Unidirectional Networks

SIAM Journal on Computing, 1994
Summary: This paper addresses the question of distributively computing over a strongly connected unidirectional data communication network. In unidirectional networks the existence of a communication link from one node to another does not imply the existence of a link in the opposite direction.
Yehuda Afek, Eli Gafni
openaire   +2 more sources

Distributed coordination in optimization algorithms

1997
In this paper we present a parallel algorithm for the solution of discrete optimization problems, which is a typical example of highly irregularly structured problems.
DI MARTINO B., MAZZEO A., MAZZOCCA, NICOLA, RUSSO S. .   +3 more
openaire   +5 more sources

Locality in Distributed Graph Algorithms

SIAM Journal on Computing, 1992
The paper deals with distributed solutions of graph problems. The model assumes that each node of the graph is occupied by a processor that has a unique ID number. Moreover, the computation is reliable, synchronous, and communication is accomplished by message passing along the edges of the graph. Let \(\text{diam}(G)\) denote the diameter of the graph
openaire   +2 more sources

Efficient Distributed Algorithms

2022
openaire   +1 more source

Distributed algorithms

2014
The new edition of a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often
openaire   +2 more sources