Results 281 to 290 of about 1,313,618 (334)

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
Kindler, Ekkart, Peuker, Sibylle
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

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

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

Distributed Caching Algorithms for Content Distribution Networks

2010 Proceedings IEEE INFOCOM, 2010
The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV services with features such as CatchUp/PauseLive TV and NPVR capabilities. The `time-shifted' nature of these personalized applications defies the broadcast paradigm underlying ...
Borst, S.C., Gupta, V., Walid, A.
openaire   +2 more sources

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

Job distribution algorithms

Automation and Remote Control, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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 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

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
Sen, Sandeep, Gupta, Neelima
openaire   +2 more sources

Distributed Iterative Algorithms

IFAC Proceedings Volumes, 1988
Abstract We consider iterative algorithms of the form x := f(x) , executed by a distributed network of processors. We first discuss a few possibilities for synchronous execution. We then consider asynchronous implementations whereby each processor iterates on a different component of x , at its own pace, using the most recently received (but ...
openaire   +1 more source