Abstract:
We propose an approximate algorithm to build the speed-optimal schedule for the set of heterogeneous jobs. Some jobs admit interruption while others do not. We allow for the arbitrary processors' speed. We use the multicoasting algorithm with calibration and the modified algorithm of packing.
Keywords:multiprocessor system, interruptible and non-interruptible jobs, scheduling.