Skip to content
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

Hack to give preference to less loaded nodes #123

Merged
merged 1 commit into from
May 21, 2015
Merged

Hack to give preference to less loaded nodes #123

merged 1 commit into from
May 21, 2015

Conversation

schmichael
Copy link
Contributor

No description provided.


// Sleep proportional to number of tasks
n := len(e.bc.Tasks())
time.Sleep(time.Duration(n>>2) * time.Millisecond)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

hey I like the shift method, so we dn't get divide by zero errors

@epsniff
Copy link
Contributor

epsniff commented May 21, 2015

👍 just in case you go this route

@Ropes
Copy link

Ropes commented May 21, 2015

token 👍

@schmichael
Copy link
Contributor Author

Merging but made issue #125 to hopefully come up with a better solution later.

schmichael added a commit that referenced this pull request May 21, 2015
Hack to give preference to less loaded nodes
@schmichael schmichael merged commit 8d088da into master May 21, 2015
@schmichael schmichael deleted the anchor branch May 21, 2015 19:52
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

3 participants