From 1628c616ba49a4034f8ae93a49f2f37332deb771 Mon Sep 17 00:00:00 2001 From: Zac Medico Date: Fri, 1 Aug 2008 10:14:39 +0000 Subject: Update the Parallel Scheduling section to describe the current algorithm. svn path=/main/trunk/; revision=11311 --- doc/dependency_resolution/task_scheduling.docbook | 8 +++++++- 1 file changed, 7 insertions(+), 1 deletion(-) diff --git a/doc/dependency_resolution/task_scheduling.docbook b/doc/dependency_resolution/task_scheduling.docbook index 01953128e..c8e3608d1 100644 --- a/doc/dependency_resolution/task_scheduling.docbook +++ b/doc/dependency_resolution/task_scheduling.docbook @@ -68,7 +68,13 @@ Parallel Scheduling - TODO: Spawn an appropriate number of tasks in parallel when desired. + The algorithm used to choose packages that will execute concurrently + with other packages is as conservative as possible in the sense that + a given package will not be executed if the subgraph composed of its + direct and indirect dependencies contains any scheduled merges. By + ensuring that the subgraph of deep dependencies is fully up to date + in this way, potential problems are avoided which could be triggered + by other build orders that are less optimal. -- cgit v1.2.3-1-g7c22