Thumbnail
Access Restriction
Subscribed

Author Gonzalez, Teofilo F. ♦ Johnson, Donald B.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1980
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract An algorithm which schedules forests of $\textit{n}$ tasks on $\textit{m}$ identical processors in $\textit{O}(\textit{n}$ log $\textit{m})$ time, offline, is given. The schedules are optimal with respect to finish time and contain at most $\textit{n}$ - 2 preemptions, a bound which is realized for all $\textit{n}.$ Also given is a simpler algorithm which runs in $\textit{O}(\textit{nm})$ time on the same problem and can be adapted to give optimal finish time schedules on-line for independent tasks with release times.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1980-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 27
Issue Number 2
Page Count 26
Starting Page 287
Ending Page 312


Open content in new tab

   Open content in new tab
Source: ACM Digital Library