forked from TrueCloudLab/hrw
Compare commits
4 commits
| Author | SHA1 | Date | |
|---|---|---|---|
| e4c2664dc5 | |||
| 3a8489bfe7 | |||
| 1b7ec474c9 | |||
| 78c3f718b1 |
3 changed files with 6 additions and 7 deletions
3
CODEOWNERS
Normal file
3
CODEOWNERS
Normal file
|
|
@ -0,0 +1,3 @@
|
||||||
|
.* @TrueCloudLab/storage-core-committers @TrueCloudLab/storage-core-developers
|
||||||
|
.forgejo/.* @potyarkin
|
||||||
|
Makefile @potyarkin
|
||||||
3
LICENSE
3
LICENSE
|
|
@ -1,6 +1,7 @@
|
||||||
MIT License
|
MIT License
|
||||||
|
|
||||||
Copyright (c) 2019 NSPCC
|
Copyright (c) 2023-2024 TrueCloudLab
|
||||||
|
Copyright (c) 2019-2023 NSPCC
|
||||||
|
|
||||||
Permission is hereby granted, free of charge, to any person obtaining a copy
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
of this software and associated documentation files (the "Software"), to deal
|
of this software and associated documentation files (the "Software"), to deal
|
||||||
|
|
|
||||||
|
|
@ -1,15 +1,10 @@
|
||||||
# Golang HRW implementation
|
# Golang HRW implementation
|
||||||
|
|
||||||
[](https://travis-ci.org/nspcc-dev/hrw)
|
|
||||||
[](https://codecov.io/gh/nspcc-dev/hrw)
|
|
||||||
[](https://goreportcard.com/report/github.com/nspcc-dev/hrw)
|
|
||||||
[](https://github.com/nspcc-dev/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:
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Add table
Reference in a new issue