Results 251 to 260 of about 4,253,766 (293)

A distributed join algorithm

Information Processing Letters, 1990
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Philip Hingston, Ross Wilkinson
openaire   +1 more source

Distributed Algorithm Engineering

2002
When one engineers distributed algorithms, some special characteristics arise that are different from conventional (sequential or parallel) computing paradigms. These characteristics include: the need for either a scalable real network environment or a platform supporting a simulated distributed environment; the need to incorporate asynchrony, where ...
Paul G. Spirakis, Christos D. Zaroliagis
openaire   +2 more sources

Distributed Perception Algorithm

2016
In this paper we describe the Distributed Perception Algorithm (DPA) which is partly inspired by the schooling behaviour of ‘golden shiner’ fish (Notemigonus crysoleucas). These fish display a preference for shaded habitat and recent experimental work has shown that the fish use both individual and distributed perception in navigating their environment.
Anthony Brabazon, Wei Cui
openaire   +2 more sources

Distribution-sensitive algorithms

1998
Summary: We investigate a new paradigm of algorithm design for geometric problems that can be termed distribution-sensitive. Our notion of distribution is more combinatorial in nature than spatial. We illustrate this on problems like planar-hulls and 2D-maxima where some of the previously known output-sensitive algorithms are recast in this setting. In
Sandeep Sen, Neelima Gupta
openaire   +3 more sources

On distributed snapshot algorithms

Proceedings. Advances in Parallel and Distributed Computing, 2002
Snapshot algorithms are fundamental for many distributed applications and must often be executed repeatedly. We present three snapshot algorithms. The first one is based on the assumption of global time, it computes channel states using several schemes. Taking consistent cut for global time instant, we show that the algorithm is applicable for existing
Letian He, Yongqiang Sun
openaire   +1 more source

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

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   +3 more sources

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

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   +2 more sources