TrueCloudLab/hrw
21
0
Fork 7
Code Issues 2 Pull requests Releases 2 Activity

[#9] doc: Remove nspcc mentions from README #10

Merged
realloc merged 1 commit from aarifullin/hrw:feature/9-replace_nspcc into master 2023-06-14 09:53:22 +00:00
Conversation 0 Commits 1 Files changed 1 +5 -5
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
README.md
View file

@ -1,15 +1,15 @@
# Golang HRW implementation # Golang HRW implementation
[![Build Status](https://travis-ci.org/nspcc-dev/hrw.svg?branch=master)](https://travis-ci.org/nspcc-dev/hrw) [![Build Status](https://travis-ci.org/TrueCloudLab/hrw.svg?branch=master)](https://travis-ci.org/TrueCloudLab/hrw)
[![codecov](https://codecov.io/gh/nspcc-dev/hrw/badge.svg)](https://codecov.io/gh/nspcc-dev/hrw) [![codecov](https://codecov.io/gh/TrueCloudLab/hrw/badge.svg)](https://codecov.io/gh/TrueCloudLab/hrw)
[![Report](https://goreportcard.com/badge/github.com/nspcc-dev/hrw)](https://goreportcard.com/report/github.com/nspcc-dev/hrw) [![Report](https://goreportcard.com/badge/github.com/TrueCloudLab/hrw)](https://goreportcard.com/report/github.com/TrueCloudLab/hrw)
[![GitHub release](https://img.shields.io/github/release/nspcc-dev/hrw.svg)](https://github.com/nspcc-dev/hrw) [![GitHub release](https://img.shields.io/github/v/release/TrueCloudLab/hrw.svg)](https://git.frostfs.info/TrueCloudLab/hrw)
[Rendezvous or highest random weight](https://en.wikipedia.org/wiki/Rendezvous_hashing) (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible set of n options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. When k is 1, it subsumes the goals of consistent hashing, using an entirely different method. [Rendezvous or highest random weight](https://en.wikipedia.org/wiki/Rendezvous_hashing) (HRW) hashing is an algorithm that allows clients to achieve distributed agreement on a set of k options out of a possible set of n options. A typical application is when clients need to agree on which sites (or proxies) objects are assigned to. When k is 1, it subsumes the goals of consistent hashing, using an entirely different method.
## Install ## Install
`go get github.com/nspcc-dev/hrw` `go get git.frostfs.info/TrueCloudLab/hrw`
## Benchmark: ## Benchmark: