A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Scheduling in the dark
2000
Theoretical Computer Science
We considered non-clairvoyant multiprocessor scheduling of jobs with arbitrary arrival times and changing execution characteristics. The problem has been studied extensively when either the jobs all arrive at time zero, or when all the jobs are fully parallelizable, or when the scheduler has considerable knowledge about the jobs. This paper considers for the ÿrst time this problem without any of these three restrictions although our algorithm is given more resources than the adversary. We
doi:10.1016/s0304-3975(99)00186-3
fatcat:cxs4tvykn5dzlcob7dnycqmobi