1 |
Author: zmedico |
2 |
Date: 2008-08-01 10:14:39 +0000 (Fri, 01 Aug 2008) |
3 |
New Revision: 11311 |
4 |
|
5 |
Modified: |
6 |
main/trunk/doc/dependency_resolution/task_scheduling.docbook |
7 |
Log: |
8 |
Update the Parallel Scheduling section to describe the current algorithm. |
9 |
|
10 |
|
11 |
Modified: main/trunk/doc/dependency_resolution/task_scheduling.docbook |
12 |
=================================================================== |
13 |
--- main/trunk/doc/dependency_resolution/task_scheduling.docbook 2008-08-01 07:33:15 UTC (rev 11310) |
14 |
+++ main/trunk/doc/dependency_resolution/task_scheduling.docbook 2008-08-01 10:14:39 UTC (rev 11311) |
15 |
@@ -68,7 +68,13 @@ |
16 |
<sect1 id='dependency-resolution-task-scheduling-parallel'> |
17 |
<title>Parallel Scheduling</title> |
18 |
<para> |
19 |
- TODO: Spawn an appropriate number of tasks in parallel when desired. |
20 |
+ The algorithm used to choose packages that will execute concurrently |
21 |
+ with other packages is as conservative as possible in the sense that |
22 |
+ a given package will not be executed if the subgraph composed of its |
23 |
+ direct and indirect dependencies contains any scheduled merges. By |
24 |
+ ensuring that the subgraph of deep dependencies is fully up to date |
25 |
+ in this way, potential problems are avoided which could be triggered |
26 |
+ by other build orders that are less optimal. |
27 |
</para> |
28 |
</sect1> |
29 |
</chapter> |