Distributed algorithm - Revision history

Cg2916: /* top */Fixing links to disambiguation pages

2024-01-15T00:12:13Z

top: Fixing links to disambiguation pages

← Previous revision		Revision as of 00:12, 15 January 2024
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 different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|publisher=[[Morgan Kaufmann Publishers]]\|location=San Francisco, CA\|year=1996\|isbn=978-1-55860-348-6}}</ref>		A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different application areas of [[distributed computing]], such as [[telecommunications]], [[scientific computing]], distributed [[Data processing\|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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|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"/>		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"/>

Fabfur: I think should be "Algorithms for solving the atomic commit problem" and not "Algorithms for solving the atomic commit protocol"

2023-02-02T21:19:14Z

I think should be "Algorithms for solving the atomic commit problem" and not "Algorithms for solving the atomic commit protocol"

← Previous revision		Revision as of 21:19, 2 February 2023
Line 6:		Line 6:
	; [[Atomic commit]]		; [[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.		: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]].		:Algorithms for solving the atomic commit problem include the [[two-phase commit protocol]] and the [[three-phase commit protocol]].
	; [[Consensus (computer science)\|Consensus]]		; [[Consensus (computer science)\|Consensus]]
	:Consensus algorithms try to solve the problem of a number of processes agreeing on a common decision.		:Consensus algorithms try to solve the problem of a number of processes agreeing on a common decision.

196.191.101.79 at 07:33, 24 November 2022

2022-11-24T07:33:52Z

← Previous revision		Revision as of 07:33, 24 November 2022
Line 1:		Line 1:
	A '''distributed algorithm'''~~hamza~~ is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|publisher=[[Morgan Kaufmann Publishers]]\|location=San Francisco, CA\|year=1996\|isbn=978-1-55860-348-6}}</ref>		A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|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"/>		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"/>

196.191.101.79 at 07:31, 24 November 2022

2022-11-24T07:31:56Z

← Previous revision		Revision as of 07:31, 24 November 2022
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 different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|publisher=[[Morgan Kaufmann Publishers]]\|location=San Francisco, CA\|year=1996\|isbn=978-1-55860-348-6}}</ref>		A '''distributed algorithm'''hamza is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|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"/>		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"/>

Citation bot: Add: bibcode. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar

2021-11-15T05:47:46Z

Add: bibcode. | Use this bot. Report bugs. | Suggested by Abductive | #UCB_toolbar

← Previous revision		Revision as of 05:47, 15 November 2021
Line 35:		Line 35:

	== Further reading ==		== Further reading ==
	* {{citation\|author1=Christian Cachin \|author2=Rachid Guerraoui \|author3=Luís Rodrigues \|title=Introduction to Reliable and Secure Distributed Programming\| publisher=Springer\| year=2011\| isbn=978-3-642-15259-7\| edition=2.}}		* {{citation\|author1=Christian Cachin \|author2=Rachid Guerraoui \|author3=Luís Rodrigues \|title=Introduction to Reliable and Secure Distributed Programming\| publisher=Springer\| year=2011\|bibcode=2011itra.book.....C \| isbn=978-3-642-15259-7\| edition=2.}}
	*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.		*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.

Hellacioussatyr: /* Standard problems */ unify list

2021-07-14T21:06:38Z

Standard problems: unify list

Jarble: link inter-process communication using Find link

2021-05-23T00:44:04Z

link inter-process communication using Find link

← Previous revision		Revision as of 00:44, 23 May 2021
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 different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|publisher=[[Morgan Kaufmann Publishers]]\|location=San Francisco, CA\|year=1996\|isbn=978-1-55860-348-6}}</ref>		A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|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"/>		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 ==		== Standard problems ==

Dokidaki-ylc at 19:43, 15 May 2021

2021-05-15T19:43:26Z

← Previous revision		Revision as of 19:43, 15 May 2021
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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|publisher=[[Morgan Kaufmann Publishers]]\|location=San Francisco, CA\|year=1996\|isbn=978-1-55860-348-6}}</ref>		A '''distributed algorithm''' is an [[algorithm]] designed to run on [[computer hardware]] constructed from interconnected [[Central processing unit\|processors]]. Distributed algorithms are used in different 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\|url=https://archive.org/details/distributedalgor0000lync\|url-access=registration\|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"/>		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"/>
Line 23:		Line 23:
	; [[Leader election]]		; [[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.		: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 of 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]]		; [[Mutual exclusion]]
Line 33:		Line 33:
	:Reliable broadcast is a communication primitive in distributed systems. A reliable broadcast is defined by the following properties:		: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		:* '''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		:* '''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		:* '''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.		:A reliable broadcast can have sequential, causal or total ordering.

2601:281:8400:3B59:0:0:0:B39: Fix capitalization of Paxos and mention Raft

2020-05-26T14:21:36Z

Fix capitalization of Paxos and mention Raft

← Previous revision		Revision as of 14:21, 26 May 2020
Line 17:		Line 17:
	:* '''Agreement''': if a correct process decides <math>v</math>, then every correct process decides <math>v</math>.		:* '''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]].		:Common algorithms for solving consensus are the [[Paxos algorithm]] and the [[Raft (computer science)\|Raft algorithm]].

	; Distributed search		; Distributed search

Deacon Vorbis: Reverted 2 edits by Wfokkink (talk): Refspam (TW)

2020-03-02T12:53:58Z

Reverted 2 edits by Wfokkink (talk): Refspam (TW)

← Previous revision		Revision as of 12:53, 2 March 2020
Line 48:		Line 48:

	== Further reading ==		== Further reading ==
	* {{citation\|author1=Christian Cachin \|author2=Rachid Guerraoui \|author3=Luís Rodrigues \|title=Introduction to Reliable and Secure Distributed Programming\| publisher=Springer\| year=2011\| isbn=978-3-642-15259-7\| edition=2}}		* {{citation\|author1=Christian Cachin \|author2=Rachid Guerraoui \|author3=Luís Rodrigues \|title=Introduction to Reliable and Secure Distributed Programming\| publisher=Springer\| year=2011\| isbn=978-3-642-15259-7\| edition=2.}}
			*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.
	* {{citation\|author1=Wan Fokkink \|title=Distributed Algorithms: An Intuitive Approach\| publisher=The MIT Press\| year=2018\| isbn=9780262037662\| edition=2}}

	==External links==		==External links==

← Previous revision		Revision as of 21:06, 14 July 2021
Line 7:		Line 7:
	: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.		: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]].		:Algorithms for solving the atomic commit protocol include the [[two-phase commit protocol]] and the [[three-phase commit protocol]].

	; [[Consensus (computer science)\|Consensus]]		; [[Consensus (computer science)\|Consensus]]
	:Consensus algorithms try to solve the problem of a number of processes agreeing on a common decision.		: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.		:More precisely, a Consensus protocol must satisfy the four formal properties below.

	:* '''Termination''': every correct process decides some value.		:* '''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>.		:* '''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.		:* '''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>.		:* '''Agreement''': if a correct process decides <math>v</math>, then every correct process decides <math>v</math>.

	:Common algorithms for solving consensus are the [[Paxos algorithm]] and the [[Raft (computer science)\|Raft algorithm]].		:Common algorithms for solving consensus are the [[Paxos algorithm]] and the [[Raft (computer science)\|Raft algorithm]].

	; Distributed search		; Distributed search

	; [[Leader election]]		; [[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 of 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.		: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 of 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]]		; [[Mutual exclusion]]

	; [[Non-blocking data structures]]		; [[Non-blocking data structures]]

	;[[Terminating Reliable Broadcast\|Reliable Broadcast]]		;[[Terminating Reliable Broadcast\|Reliable Broadcast]]

	:Reliable broadcast is a communication primitive in distributed systems. A reliable broadcast is defined by the following properties:		: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.		:* '''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.		:* '''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.		:* '''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.		:A reliable broadcast can have sequential, causal or total ordering.

	; [[Replication (computer science)\|Replication]]		; [[Replication (computer science)\|Replication]]
	; [[Resource allocation]]		; [[Resource allocation]]