GitHub user chuanlei opened a pull request:
https://github.com/apache/storm/pull/584
Feature add topology based scheduler
New Scheduler based on the static information of Topology
Here we convert the schedule problem as a min-cut problem. i.e.
We should partition the graph into some clusters where the number of
clusters is the number of workers.
Now I have implemented the algorithm of Karger's Min-Cut algorithm to solve
this problem.
And if we take the runtime stats into account, this approach is natural to
extend.
Maybe we can have another solution.
You can merge this pull request into a Git repository by running:
$ git pull https://github.com/chuanlei/storm
feature-add-topology-based-scheduler
Alternatively you can review and apply these changes as the patch at:
https://github.com/apache/storm/pull/584.patch
To close this pull request, make a commit to your master/trunk branch
with (at least) the following in the commit message:
This closes #584
----
commit 5817cc43bfff97ff79877f219e72f4c64e7cf761
Author: Chuanlei Ni <[email protected]>
Date: 2015-06-05T18:31:20Z
Merge pull request #1 from apache/master
sync
commit c5b52f00a41e73c8257523b9203939bb4808d0ca
Author: chuanlei <[email protected]>
Date: 2015-06-08T19:25:24Z
New Scheduler based on Topology static info
----
---
If your project is set up for it, you can reply to this email and have your
reply appear on GitHub as well. If your project does not have this feature
enabled and wishes so, or if the feature is enabled but not working, please
contact infrastructure at [email protected] or file a JIRA ticket
with INFRA.
---
