About: Rendezvous hashing

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of options out of a possible set of options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. Rendezvous hashing is both much simpler and more general than consistent hashing, which becomes a special case (for ) of rendezvous hashing.

Property Value
dbo:abstract
  • Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of options out of a possible set of options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. Rendezvous hashing is both much simpler and more general than consistent hashing, which becomes a special case (for ) of rendezvous hashing. (en)
  • 랑데부(Rendezvous) 또는 HRW (High Random Random Weight) 해싱 은 클라이언트가 가능한 n개의 선택지에서 k개의 선택에 대해 분산 합의를 달성할 수 있게 하는 알고리즘이다. 전형적인 예는 클라이언트가 개체들이 할당될 사이트들이 어떤 것인지 합의해야할 때이다. 일관된 해싱은 랑데부 해싱의 특수한 경우이다. (ko)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 40543215 (xsd:integer)
dbo:wikiPageLength
  • 25921 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1124809129 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • Rendezvous or highest random weight (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of options out of a possible set of options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. Rendezvous hashing is both much simpler and more general than consistent hashing, which becomes a special case (for ) of rendezvous hashing. (en)
  • 랑데부(Rendezvous) 또는 HRW (High Random Random Weight) 해싱 은 클라이언트가 가능한 n개의 선택지에서 k개의 선택에 대해 분산 합의를 달성할 수 있게 하는 알고리즘이다. 전형적인 예는 클라이언트가 개체들이 할당될 사이트들이 어떤 것인지 합의해야할 때이다. 일관된 해싱은 랑데부 해싱의 특수한 경우이다. (ko)
rdfs:label
  • 랑데부 해싱 (ko)
  • Rendezvous hashing (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License