Access Restriction

Author Denning, Peter J. ♦ Graham, G. Scott
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Multiprocessor scheduling ♦ Task scheduling ♦ Scheduling ♦ Tree scheduling
Abstract A counterexample to the supposed optimality of an algorithm for generating schedules for trees of tasks with unequal execution times is presented. A comparison with the “critical path” heuristic is discussed.
Description Affiliation: Purdue Univ., Lafayette, IN (Denning, Peter J.; Graham, G. Scott)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 11
Page Count 3
Starting Page 700
Ending Page 702

Open content in new tab

   Open content in new tab
Source: ACM Digital Library