Results 241 to 250 of about 1,301,602 (288)

Integrating Distributed Algorithms into Distributed Systems [PDF]

Fundamenta Informaticae, 1999
A distributed algorithm is often used as a part of a larger distributed system. Usually, the properties of an algorithm are proven for the algorithm in isolation. Then, it is not obvious how the algorithm behaves when integrated into a larger system. In this paper, we present a simple technique which allows to derive properties of an algorithm which is
Ekkart Kindler, Sibylle Peuker
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A distributed algorithm for distributed termination

Information Processing Letters, 1987
We improve on \textit{S. P. Rana}'s [ibid. 17, 43-46 (1983; Zbl 0509.68020)] distributed and fully symmetric solution for detection of distributed termination.
Cyrus Hazari, Hussein Zedan
openaire   +2 more sources

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

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

A distributed stereocorrelation algorithm

Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95, 2002
This paper addresses the problem of parallelizing one of the most computationally intensive imaging tasks, namely, the stereocorrelation operation. Stereocorrelation is a statistical procedure utilized to automatically derive the depth information from a pair of digitized pictures taken from the same scene but at different positions.
openaire   +1 more source

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   +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   +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