A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is
Journal of the ACM
An investigation IS made of the worst-case performance of two related algorithms for scheduhng umt-execut~on-ume task systems w~th resources Unhke most prewous scheduhng results for task systems w~th resources, ~t ~s assumed that there are afixed number of processors m the system. This assumption has both practical and theoreucal interest An upper bound is gwen for the worst-case performance of critical path scheduhng for these task systems This bound depends on both the number of processorsdoi:10.1145/322326.322336 fatcat:iyr3qjtalje3tlicgm6zrtpfva