Experimental study of deadline scheduling for interactive systems

Abstract

This paper outlines a resource allocation strategy called deadline scheduling, which is intended for use in interactive systems. Experiments are reported in which simplified versions of deadline scheduling and two time slicing strategies are modeled and compared under identical conditions. Results suggest that deadline scheduling, primarily by reducing paging overhead, provides faster response and supports more interactive users concurrently than do the two time methods.