commit | cf8520a2b51d2233aaf39f1788dc7631538c7db2 | [log] [tgz] |
---|---|---|
author | Yi Wang <i3.wangyi@gmail.com> | Fri Sep 06 16:57:25 2019 -0700 |
committer | Jiajun Wang <1803880+jiajunwang@users.noreply.github.com> | Fri Feb 07 12:24:22 2020 -0800 |
tree | c1b22e15f4dd92d9646b0a4682882759ac484bef | |
parent | eb437c9975058e48331499ea7f8df82705f07406 [diff] |
Implement the basic constraint based algorithm (#381) Implement basic constraint algorithm: Greedy based, each time it picks the best scores given each replica and assigns the replica to the node. It doesn't guarantee to achieve global optimal but local optimal result The algorithm is based on a given set of constraints * HardConstraint: Approve or deny the assignment given its condition, any assignment cannot bypass any "hard constraint" * SoftConstraint: Evaluate the assignment by points/rewards/scores, a higher point means a better assignment The goal is to avoid all "hard constraints" while accumulating the most points(rewards) from "soft constraints"
Helix is part of the Apache Software Foundation.
Project page: http://helix.apache.org/
Mailing list: http://helix.apache.org/mail-lists.html
mvn clean install package -DskipTests
Helix is a generic cluster management framework used for automatic management of partitioned, replicated and distributed resources hosted on a cluster of nodes. Helix provides the following features: