Dmitry Shulyak e2cfa869d8 Implement traversal based on number of childs ... By using childs weights for scheduling we can unlock concurrent and decrease total time of execution. As an example consider next variant: Tasks A and B can't run concurrently because of node-limit. Tasks A and C have logical dependency, and thus not concurrent. Tasks B and C will be executed on different nodes, and doesnt have any logical dependency. As A and B doesnt have parents we may schedule any of this task and logically execution will be correct, but in case if we will choose B total time of execution will be - B + A + C, BUT if we will select A - total time of execution may be reduced, and will take in total - A + max(B, C). Change-Id: I52a6c20e8c3d729ed20da822f45cbad90e51f2df Closes-Bug: 1554105		2016-03-23 11:08:51 +00:00
..
conftest.py	Plugable constructors, runners and hooks	2016-02-01 16:50:40 +02:00
test_complete_solar_workflow.py	Implement traversal based on number of childs	2016-03-23 11:08:51 +00:00
test_orchestration_scheduling.py	Refactoring of graph.py and usage of it in scheduler	2016-03-23 13:08:14 +02:00
test_retries.py	Refactoring of graph.py and usage of it in scheduler	2016-03-23 13:08:14 +02:00
test_timelimit_timeout_support.py	Refactoring of graph.py and usage of it in scheduler	2016-03-23 13:08:14 +02:00
test_weights.py	Implement traversal based on number of childs	2016-03-23 11:08:51 +00:00