Scheduling tree-structured tasks on two processors to minimize schedule length

Scheduling tree-structured tasks on two processors to minimize schedule length

0.00 Avg rating—0 Votes
Article ID: iaor19881012
Country: United States
Volume: 2
Issue: 2
Start Page Number: 176
End Page Number: 196
Publication Date: May 1989
Journal: SIAM Journal On Discrete Mathematics
Authors: ,
Keywords: combinatorial analysis
Abstract:

Consider a set of n tasks with a tree-structured precedence relation and execution time of 1 or 3 units. The authors give an O(n2logn)-time algorithm to find a minimum length schedule for these tasks on two identical processors. Possible generalization to the case of 1 or k units is also given.

Reviews

Required fields are marked *. Your email address will not be published.