Distributed algorithm: Difference between revisions

Revision as of 22:52, 5 December 2008

Revision as of 13:00, 10 January 2009

Line 1:

{{Expand|date=July 2007}}

A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[cpu|processors]]. The separate parts of a distributed algorithm are typically executed [[concurrency (computer science)|concurrently]], and have limited information about what the other parts of the algorithm are doing. One of the major challenges in developing and implementing distributed algorithms is successfully coordinating the behavior of the independent parts of the algorithm in the face of processor failures and unreliable communications links. Distributed algorithms are used in various application areas of [[distributed computing]], such as [[telecommunications]], [[scientific computing]], distributed [[information processing]], and real-time [[process control]].<ref name="lynch1997">{{cite book|last=Lynch|first=Nancy|title=Distributed Algorithms|publisher=Morgan Kaufman Publishers|___location=San Francisco, CA|date=1997|edition=1st|isbn=978-1558603486}}</ref>

A '''distributed algorithm''' is an [[algorithm]] that tries to solve a typical problem in [[distributed computing]].

Here is a list of distributed algorithms by problem:

=== [[Leader election|Leader Election]] ===

Line 34 ⟶ 33:

=== Replication ===

ROWA, ROWAA, QA

== References ==

{{reflist}}

== External links ==