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

Dependency graph based scheduling #40

Open
raloos opened this issue Aug 31, 2010 · 3 comments
Open

Dependency graph based scheduling #40

raloos opened this issue Aug 31, 2010 · 3 comments

Comments

@raloos
Copy link
Member

raloos commented Aug 31, 2010

Generate a dependency graph using a topological sort algorithm for true dependency based scheduling. This can increase efficiency and would create true fair scheduling which solves the problem of skewing and queueing which is present now when one processor is much heavier to process than a parallel one in the graph.

@micheljansen
Copy link
Member

This might get pretty big. Maybe ontwerpproject material? ;)

@raloos
Copy link
Member Author

raloos commented Aug 31, 2010

hehehe, check commit net ;)

@micheljansen
Copy link
Member

nice!

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

2 participants