Resource bounded measure: Difference between revisions
Jump to navigation
Jump to search
en>Helpful Pixie Bot m ISBNs Fix unbalanced header markup. (Build KC) |
|||
| Line 1: | Line 1: | ||
A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit|processors]]. Distributed algorithms are used in many varied application areas of [[distributed computing]], such as [[telecommunications]], [[scientific computing]], distributed [[information processing]], and real-time [[process control]]. Standard problems solved by distributed algorithms include [[leader election]], [[Consensus (computer science)|consensus]], distributed [[Search algorithm|search]], [[Spanning tree (mathematics)|spanning tree]] generation, [[mutual exclusion]], and [[resource allocation]].<ref name="lynch1997">{{cite book|last=Lynch|first=Nancy|title=Distributed Algorithms|publisher=[[Morgan Kaufmann Publishers]]|location=San Francisco, CA|year=1996|isbn=978-1-55860-348-6}}</ref> | |||
Distributed algorithms are a sub-type of [[Parallel algorithm]], typically executed [[concurrency (computer science)|concurrently]], with separate parts of the algorithm being run simultaneously on independent processors, and having 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. The choice of an appropriate distributed algorithm to solve a given problem depends on both the characteristics of the problem, and characteristics of the system the algorithm will run on such as the type and probability of processor or link failures, the kind of inter-process communication that can be performed, and the level of timing synchronization between separate processes.<ref name="lynch1997"/> | |||
== Standard problems == | |||
; [[Atomic commit]] | |||
:An atomic commit is an operation where a set of distinct changes is applied as a single operation. If the atomic commit succeeds, it means that all the changes have been applied. If there is a failure before the atomic commit can be completed, the "commit" is aborted and no changes will be applied. | |||
:Algorithms for solving the atomic commit protocol include the [[two-phase commit protocol]] and the [[three-phase commit protocol]]. | |||
; [[Consensus (computer science)|Consensus]] | |||
:Consensus algorithms try to solve the problem of a number of processes agreeing on a common decision. | |||
:More precisely, a Consensus protocol must satisfy the four formal properties below. | |||
:* '''Termination''': every correct process decides some value. | |||
:* '''Validity''': if all processes propose the same value <math>v</math>, then every correct process decides <math>v</math>. | |||
:* '''Integrity''': every correct process decides at most one value, and if it decides some value <math>v</math>, then <math>v</math> must have been proposed by some process. | |||
:* '''Agreement''': if a correct process decides <math>v</math>, then every correct process decides <math>v</math>. | |||
:A typical algorithm for solving consensus is the [[paxos algorithm]]. | |||
; Distributed search | |||
; [[Leader election]] | |||
:Leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are unaware which node will serve as the "leader," or coordinator, of the task. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader. | |||
; [[Mutual exclusion]] | |||
; Reliable Broadcast | |||
:Reliable broadcast is a communication primitive in distributed systems. A reliable broadcast is defined by the following properties: | |||
:* '''Validity''' - if a correct process sends a message, then some correct process will eventually deliver that message | |||
:* '''Agreement''' - if a correct process delivers a message, then all correct processes eventually deliver that message | |||
:* '''Integrity''' - every correct process delivers the same message at most once and only if that message has been sent by a process | |||
:A reliable broadcast can have sequential, causal or total ordering. | |||
; [[Replication (computer science)|Replication]] | |||
; [[Resource allocation]] | |||
; [[Spanning tree]] generation | |||
; Symmetry breaking, e.g. [[vertex coloring]] | |||
== References == | |||
{{reflist}} | |||
== Further reading == | |||
*C. Rodríguez, M. Villagra and B. Barán, {{doi-inline|10.1109/BIMNICS.2007.4610083|Asynchronous team algorithms for Boolean Satisfiability}}, Bionetics2007, pp. 66–69, 2007. | |||
== External links == | |||
*[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-852j-distributed-algorithms-fall-2009/ MIT Open Courseware - Distributed Algorithms] <!-- material here should eventually be absorbed into this article --> | |||
{{DEFAULTSORT:Distributed Algorithms}} | |||
[[Category:Distributed algorithms| ]] | |||
Latest revision as of 11:12, 13 May 2013
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are used in many varied application areas of distributed computing, such as telecommunications, scientific computing, distributed information processing, and real-time process control. Standard problems solved by distributed algorithms include leader election, consensus, distributed search, spanning tree generation, mutual exclusion, and resource allocation.[1]
Distributed algorithms are a sub-type of Parallel algorithm, typically executed concurrently, with separate parts of the algorithm being run simultaneously on independent processors, and having 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. The choice of an appropriate distributed algorithm to solve a given problem depends on both the characteristics of the problem, and characteristics of the system the algorithm will run on such as the type and probability of processor or link failures, the kind of inter-process communication that can be performed, and the level of timing synchronization between separate processes.[1]
Standard problems
- Atomic commit
- An atomic commit is an operation where a set of distinct changes is applied as a single operation. If the atomic commit succeeds, it means that all the changes have been applied. If there is a failure before the atomic commit can be completed, the "commit" is aborted and no changes will be applied.
- Algorithms for solving the atomic commit protocol include the two-phase commit protocol and the three-phase commit protocol.
- Consensus
- Consensus algorithms try to solve the problem of a number of processes agreeing on a common decision.
- More precisely, a Consensus protocol must satisfy the four formal properties below.
- Termination: every correct process decides some value.
- Validity: if all processes propose the same value , then every correct process decides .
- Integrity: every correct process decides at most one value, and if it decides some value , then must have been proposed by some process.
- Agreement: if a correct process decides , then every correct process decides .
- A typical algorithm for solving consensus is the paxos algorithm.
- Distributed search
- Leader election is the process of designating a single process as the organizer of some task distributed among several computers (nodes). Before the task is begun, all network nodes are unaware which node will serve as the "leader," or coordinator, of the task. After a leader election algorithm has been run, however, each node throughout the network recognizes a particular, unique node as the task leader.
- Reliable Broadcast
- Reliable broadcast is a communication primitive in distributed systems. A reliable broadcast is defined by the following properties:
- Validity - if a correct process sends a message, then some correct process will eventually deliver that message
- Agreement - if a correct process delivers a message, then all correct processes eventually deliver that message
- Integrity - every correct process delivers the same message at most once and only if that message has been sent by a process
- A reliable broadcast can have sequential, causal or total ordering.
- Replication
- Resource allocation
- Spanning tree generation
- Symmetry breaking, e.g. vertex coloring
References
43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.
Further reading
- C. Rodríguez, M. Villagra and B. Barán, Template:Doi-inline, Bionetics2007, pp. 66–69, 2007.
External links
- ↑ 1.0 1.1 20 year-old Real Estate Agent Rusty from Saint-Paul, has hobbies and interests which includes monopoly, property developers in singapore and poker. Will soon undertake a contiki trip that may include going to the Lower Valley of the Omo.
My blog: http://www.primaboinca.com/view_profile.php?userid=5889534