Results 271 to 280 of about 7,855,956 (309)

Distributed BFS algorithms

26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985
This paper develops a new distributed BFS algorithm for an asynchronous communication network. This paper presents two new BFS algorithms with improved communication complexity. The first algorithm has complexity O((E+V1.5)?logV) in communication and O(V1.5?logV) in time. The second algorithm uses the technique of the first recursively and achieves O(E?
Baruch Awerbuch, Robert G. Gallager
openaire   +1 more source

Distributed Systems and Algorithms

2000
This topic deals with new developments in distributed systems and algorithms. The wide acceptance of the Internet standards and technologies makes it hard to magine a situation n which t would be easier to argue about their importance than it is today.
openaire   +1 more source

Distributed algorithms for deciphering

1990
Many authors have already presented parallel implementations of the Multiple Polynomial Quadratic Sieve algorithm used to break RSA keys. They only parallelize the sieve step. We present in this paper a theoretical study of the parallelization of all the steps of the MPQS factoring algorithm for a distributed memory multiprocessor.
Michel Cosnard, Jean-Laurent Philippe
openaire   +1 more source

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

A fast distributed slicing algorithm

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, 2008
Reference LPD-CONF-2008-036View record in Web of Science URL: http://www.podc.org/podc2008/ Record created on 2008-10-13, modified on 2017-05 ...
Gramoli, Vincent, Vigfusson, Ymir, Birman, Ken, Kermarrec, Anne-Marie, van Renesse, Robbert, Bazzi, Rida, Patt-Shamir, Boaz   +6 more
openaire   +2 more sources

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