c# - How to sort depended objects by dependency for maximum concurrency -
i have list of dependencies (or better dag without cycles):
input (for example):
item depends on nothing item b depends on c, e item c depends on item d depends on e item e depends on
what i'm looking is: "what best* parallel order of items?"
*best means: maximum concurrency level
result (for example):
[a], [e, c], [d, b]
the best approach seems pseudocode getting order based on dependency think miss basic algorithm on this.
this looks lot http://en.wikipedia.org/wiki/program_evaluation_and_review_technique/http://en.wikipedia.org/wiki/critical_path_method
assuming want maximum concurrency level thing done possible, once have organised things takes no longer critical path have best possible solution - , if there no limit on amount of parallel tasks can run, can critical path scheduling every action of dependencies have completed.
Comments
Post a Comment