Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
Journal of the ACM (JACM)
A policy-driven scheduler for a time-sharing system
Communications of the ACM
Estimates of distributions of random variables for certain computer communications traffic models
Communications of the ACM
A scheduling philosophy for multiprocessing systems
Communications of the ACM
An analytical approach to computer systems scheduling
An analytical approach to computer systems scheduling
JOSS: 20,000 hours at a console: a statistical summary
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Computer scheduling methods and their countermeasures
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
A study of multiaccess computer communications
AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
| Hi-index | 0.00 |
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 slicing methods.