Nonclairvoyant scheduling

AbstractVirtually all research in scheduling theory has been concerned with clairvoyant scheduling where it is assumed that the characteristics of a job (in particular, its execution time, release time and dependence on other jobs) are known a priori. This assumption is invalid for scheduling problems that arise in time-sharing operating systems where the scheduler must provide fast turnaround for processes being generated by the users without any knowledge of the future behavior of these processes.We study preemptive, nonclairvoyant scheduling schemes where the scheduler has no knowledge of the jobs' characteristics. We develop a model for evaluating scheduling strategies for single and multiprocessor systems. This model compares the nonclairvoyant scheduler against the optimal clairvoyant scheduler, and it takes into account various issues such as release time, execution time, preemption cost, and the inter-dependence between jobs. Within this model we study some standard scheduling algorithms described in the systems literature, and we provide some theoretical justification for their effectiveness in practice by presenting some randomized and deterministic upper and lower bounds