-
Notifications
You must be signed in to change notification settings - Fork 123
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
vine: daskvine priority scheduling #3923
Closed
JinZhou5042
wants to merge
15
commits into
cooperative-computing-lab:master
from
JinZhou5042:daskvine_priority_scheduling
Closed
Changes from 12 commits
Commits
Show all changes
15 commits
Select commit
Hold shift + click to select a range
d162c21
vine: daskvine priority scheduling
JinZhou5042 19b39c9
change var name
JinZhou5042 6403a31
lint
JinZhou5042 6ef5fef
longest task first scheduling
JinZhou5042 b88d261
longest task first
JinZhou5042 8ad03a7
rename
JinZhou5042 639a9e7
Merge branch 'cooperative-computing-lab:master' into daskvine_priorit…
JinZhou5042 15effa2
Merge branch 'cooperative-computing-lab:master' into daskvine_priorit…
JinZhou5042 259c5ad
remove cat scheduling
JinZhou5042 741ae7f
cat scheduling
JinZhou5042 ae9c3fd
cat scheduling
JinZhou5042 7e3e6bd
default FIFO
JinZhou5042 103fe67
change 1e100 to float inf
JinZhou5042 b3486ce
set depth
JinZhou5042 fb208cf
Merge branch 'cooperative-computing-lab:master' into daskvine_priorit…
JinZhou5042 File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I'm not sure about this change. Didn't the old way of computing depth worked?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@btovar No, the old way didn't give me the right depth.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
In which way it didn't work? Do you have an example? Is it a different definition of graph depth?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I tested it about 2 months ago, my impression is that the depth of every task in the graph was always 0 or 1 or something fixed, and then I just wrote a new function to calculate the depth.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
It did work for me when I was testing checkpoints. Please check again because it may indicate that something else in the code broke. Also, it is a much easier code to follow, which may help with dealing with future bugs.