-
Notifications
You must be signed in to change notification settings - Fork 14
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Placement functions are buggy #438
Comments
notimetoname
changed the title
Placement function is buggy
Placement functions are buggy
Jun 2, 2023
Fixing them is likely to cause some data storm, maybe that's where we could also fix the node wrt its load data "placement". |
This was referenced Jul 25, 2023
carpawell
added a commit
to carpawell/neofs-sdk-go
that referenced
this issue
Jul 31, 2023
Do not return next element if `0` is being facing. Closes nspcc-dev#438 Signed-off-by: Pavel Karpy <carpawell@nspcc.ru>
Merged
carpawell
added a commit
to carpawell/neofs-sdk-go
that referenced
this issue
Jul 31, 2023
Do not return next element if `0` is being facing. Also, add a public key to the test nodes. It is used in `Hash()` method and, therefore, is the main start point in the HWR sorting, without it, every node is considered the same, so it is hard to pick a good value, cause sorting is random for the same hashes. Closes nspcc-dev#438. Signed-off-by: Pavel Karpy <carpawell@nspcc.ru>
carpawell
added a commit
to carpawell/neofs-sdk-go
that referenced
this issue
Jul 31, 2023
Do not return next element if `0` is being facing. Also, add a public key to the test nodes. It is used in `Hash()` method and, therefore, is the main start point in the HWR sorting, without it, every node is considered the same, so it is hard to pick a good test value, cause sorting is random for the same hashes. Closes nspcc-dev#438. Signed-off-by: Pavel Karpy <carpawell@nspcc.ru>
carpawell
added a commit
to carpawell/neofs-sdk-go
that referenced
this issue
Jul 31, 2023
Do not return next element if `0` is being facing. Also, add a public key to the test nodes. It is used in `Hash()` method and, therefore, is the main start point in the HWR sorting, without it, every node is considered the same, so it is hard to pick a good test value, cause sorting is random for the same hashes. Closes nspcc-dev#438. Signed-off-by: Pavel Karpy <carpawell@nspcc.ru>
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Placement is built using
Capacity
andPrice
attrs as a criterion forHRW
sorting. But looking for a minimumPrice
in the placement vector behaves strangely: when it finds0
Price
it saves the next element as the minimum.In short, consider the test.
The text was updated successfully, but these errors were encountered: