The first class of “think time oriented” CPU scheduling algorithms

Abstract

A bstract One goal of traditional CPU scheduling algori­ thms (like Round Robin) is to provide homogeneous service to all jobs in the system. Another traditional goal is to provide minimal mean system response time. While these goals are intuitively pleasing, there is little evidence to support the assumption that users ben­ efit from minimal mean system response time. The individuality of cadi user dictates the need for a cus­ tomized virtual system which reflects that user’s re­ sponse time needs. Think-Time Oriented CPU scheduling algorithms are introduced in an attempt to begin providing users with a customized virtual system. These algorithms obtain think-tiinc characteristics from users and then incorporate this knowledge in the scheduling process. Three non-preemptive think-time oriented algorithms arc described. Performance comparisons are then made between the think-time algorithms and FCFS.