Multi-queue scheduling of two tasks

Authors:
Jeffrey R. Spirn
Affiliations:
-
Venue:
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Year:
1976

Citing 2
Cited 1

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
An analysis of central processor scheduling in multiprogrammed computer systems (digest edition).

An analysis of central processor scheduling in multiprogrammed computer systems (digest edition).

Feedback coupled resource allocation policies in the multiprogramming-multiprocessor computer system

Communications of the ACM

Quantified Score

Hi-index	0.02

Visualization

Abstract

A class of schedules in the two customer central server queueing model, consisting of a “CPU” server and m “I/O” servers, is considered. Optimal (maximal CPU utilization) CPU and I/O schedules are obtained. The best CPU schedule depends on the I/O schedule in effect; and is either Longest or Shortest-Expected-Remaining-Processing-Time-First. However, for certain I/O schedules the CPU schedule is immaterial. The best I/O schedule is always to process the (expected) longer CPU customer first.