| 2016-03-07 15:56:55 |
Dima Shulyak |
bug |
|
|
added bug |
| 2016-03-07 15:57:00 |
Dima Shulyak |
solar: importance |
Undecided |
Medium |
|
| 2016-03-07 15:57:02 |
Dima Shulyak |
solar: milestone |
|
0.3.0 |
|
| 2016-03-07 15:57:06 |
Dima Shulyak |
solar: assignee |
|
Dima Shulyak (dshulyak) |
|
| 2016-03-07 15:57:22 |
Dima Shulyak |
solar: assignee |
Dima Shulyak (dshulyak) |
Fuel Solar (fuel-solar-team) |
|
| 2016-03-07 15:57:43 |
Dima Shulyak |
solar: status |
New |
Confirmed |
|
| 2016-03-07 15:58:07 |
Dima Shulyak |
description |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only task task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A. |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only one task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A. |
|
| 2016-03-07 15:58:27 |
Dima Shulyak |
description |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only one task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A. |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only one task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B first
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A. |
|
| 2016-03-07 16:47:34 |
Dima Shulyak |
description |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only one task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B first
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A. |
Current implementation of traversal for tasks scheduling doesn't take into account amount of childs for each scheduled task.
Computing that information before build will allow to determine more efficient order of execution.
Example:
First path - [A] (only one task)
Second path - [B, C].
Task A and B should be executed on same node, and thus they are conflicting because of one-per node task limit, but executing B first
will allow to run A and C in paralell. Thus we need to make decision that B should be executed before A.
after building a graph, apply next algorithm to calculate weights of each node:
1. topologically sort reversed graph
2. for each successors update current_weight += 1 + current_weight
3. reverse one more time and return/save
4. before applying chain of rules - sort added tasks based on current_weight
In the end we will get recursive (includes weights of child) computation of weights for each task in graph |
|
| 2016-03-21 15:20:34 |
OpenStack Infra |
solar: status |
Confirmed |
In Progress |
|
| 2016-03-21 15:20:34 |
OpenStack Infra |
solar: assignee |
Fuel Solar (fuel-solar-team) |
Dima Shulyak (dshulyak) |
|
| 2016-05-05 23:51:44 |
OpenStack Infra |
solar: status |
In Progress |
Fix Released |
|
