Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers some additional features. Raft offers a generic way to distribute a state machine across a cluster of computing systems, ensuring that each node in the cluster agrees upon the same series of state transitions. It has a number of open-source reference implementations, with full-specification implementations in Go, C++, Java, and Scala. It is named after Reliable, Replicated, Redundant, And Fault-Tolerant.
| Attributes | Values |
|---|
| rdfs:label
| - Raft (es)
- 래프트 (컴퓨터 과학) (ko)
- Raft (アルゴリズム) (ja)
- Raft (algorithm) (en)
- Raft (алгоритм) (ru)
- Raft (zh)
|
| rdfs:comment
| - Raft es un protocolo de consenso que trabaja eligiendo un líder central sobre el que se hacen las peticiones y coordina al resto de nodos (seguidores) para implementarlas. El ejemplo típico de uso de este algoritmo es para la escritura de mensajes en un log replicado. (es)
- 래프트(Raft)는 팩소스의 대안으로 설계된 합의 알고리즘이다. 래프트는 로직의 분해를 통해 팩소스보다 이해하기 쉽게 되어있으며 또한 안전하고 다른 합의 알고리즘과 다른 특징을 가진다. 래프트는 계산 시스템의 클러스터를 통해 상태 기계를 분배하는 일반화된 방법을 제공하며, 클러스터의 각 노드가 동일한 일련의 상태 전이에 동의하는지 확인한다. 이것은 여러 오픈소스로 구현되어있으며 Go, C++, 자바와 Scala에서 완전히 구현되어있다.래프트(Raft)란 이름은 "Reliable, Replicated, Redundant and Fault-Tolerant"에서 유래했다. (ko)
- Raft是一种用于替代Paxos的共识算法。相比于Paxos，Raft的目標是提供更清晰的逻辑分工使得算法本身能被更好地理解，同时它安全性更高，并能提供一些额外的特性。Raft能为在计算机集群之间部署有限状态机提供一种通用方法，并确保集群内的任意节点在某种状态转换上保持一致。Raft算法的开源实现众多，在Go、C++、Java以及 Scala中都有完整的代码实现。Raft这一名字来源于"Reliable, Replicated, Redundant, And Fault-Tolerant"（“可靠、可复制、可冗余、可容错”）的首字母缩写。 集群内的节点都对选举出的领袖采取信任，因此Raft不是一种拜占庭容错算法。 (zh)
- Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers some additional features. Raft offers a generic way to distribute a state machine across a cluster of computing systems, ensuring that each node in the cluster agrees upon the same series of state transitions. It has a number of open-source reference implementations, with full-specification implementations in Go, C++, Java, and Scala. It is named after Reliable, Replicated, Redundant, And Fault-Tolerant. (en)
- Raft — алгоритм для решения задач консенсуса в сети ненадёжных вычислений. Разрабатывался с учётом недостатковболее старого алгоритма Паксос. При выборе ключевых идей, предпочтение отдавалось более простым и практичным решениям. Тем не менее, несмотря на относительную простоту, Raft обеспечивает безопасную и эффективную реализацию машины состояний поверхкластерной вычислительной системы. (ru)
|
| foaf:depiction
| |
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| thumbnail
| |
| caption
| - The Raft consensus algorithm mascot. (en)
|
| class
| |
| has abstract
| - Raft es un protocolo de consenso que trabaja eligiendo un líder central sobre el que se hacen las peticiones y coordina al resto de nodos (seguidores) para implementarlas. El ejemplo típico de uso de este algoritmo es para la escritura de mensajes en un log replicado. (es)
- Raft is a consensus algorithm designed as an alternative to the Paxos family of algorithms. It was meant to be more understandable than Paxos by means of separation of logic, but it is also formally proven safe and offers some additional features. Raft offers a generic way to distribute a state machine across a cluster of computing systems, ensuring that each node in the cluster agrees upon the same series of state transitions. It has a number of open-source reference implementations, with full-specification implementations in Go, C++, Java, and Scala. It is named after Reliable, Replicated, Redundant, And Fault-Tolerant. Raft is not a Byzantine fault tolerant algorithm: the nodes trust the elected leader. (en)
- 래프트(Raft)는 팩소스의 대안으로 설계된 합의 알고리즘이다. 래프트는 로직의 분해를 통해 팩소스보다 이해하기 쉽게 되어있으며 또한 안전하고 다른 합의 알고리즘과 다른 특징을 가진다. 래프트는 계산 시스템의 클러스터를 통해 상태 기계를 분배하는 일반화된 방법을 제공하며, 클러스터의 각 노드가 동일한 일련의 상태 전이에 동의하는지 확인한다. 이것은 여러 오픈소스로 구현되어있으며 Go, C++, 자바와 Scala에서 완전히 구현되어있다.래프트(Raft)란 이름은 "Reliable, Replicated, Redundant and Fault-Tolerant"에서 유래했다. (ko)
- Raft — алгоритм для решения задач консенсуса в сети ненадёжных вычислений. Разрабатывался с учётом недостатковболее старого алгоритма Паксос. При выборе ключевых идей, предпочтение отдавалось более простым и практичным решениям. Тем не менее, несмотря на относительную простоту, Raft обеспечивает безопасную и эффективную реализацию машины состояний поверхкластерной вычислительной системы. Существует множество реализаций Raft с открытым исходным кодом на разныхязыках программирования.Несмотря на обиходное противопоставление Raft и Паксос, по сути Raft является протоколом семейства Paxos, и имеет много общих деталей реализации с MultiPaxos, ZAB (Zookeeper Atomic Broadcast) и другими. (ru)
- Raft是一种用于替代Paxos的共识算法。相比于Paxos，Raft的目標是提供更清晰的逻辑分工使得算法本身能被更好地理解，同时它安全性更高，并能提供一些额外的特性。Raft能为在计算机集群之间部署有限状态机提供一种通用方法，并确保集群内的任意节点在某种状态转换上保持一致。Raft算法的开源实现众多，在Go、C++、Java以及 Scala中都有完整的代码实现。Raft这一名字来源于"Reliable, Replicated, Redundant, And Fault-Tolerant"（“可靠、可复制、可冗余、可容错”）的首字母缩写。 集群内的节点都对选举出的领袖采取信任，因此Raft不是一种拜占庭容错算法。 (zh)
|
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
| is Wikipage redirect
of | |
| is foaf:primaryTopic
of | |
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)
