Process Scheduling in a Computer System

Zvi Rosberg

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A computer system is modeled by an exponential queueing network with different classes of customers and a general class of service policies. The mean cost per unit time is taken as the loss function. Three lower bounds of the loss function under the whole class of service policies, as well as an upper bound of the minimal loss, are derived. The loss function is expressed in a convenient form from which we derive a simple heuristic service policy so called “Klimov policy.” This policy is applied to several examples of computer systems and is evaluated by the bounds. The examples recommend using “Klimov policy” in any case; so we have a first rule for deciding how to provide service capacity to different customers in a network of queues.

Original languageEnglish
Pages (from-to)633-645
Number of pages13
JournalIEEE Transactions on Computers
VolumeC-34
Issue number7
DOIs
StatePublished - 1 Jan 1985
Externally publishedYes

Keywords

  • Average Cost criterion
  • Markov chains
  • queueing networks
  • service policies

Fingerprint

Dive into the research topics of 'Process Scheduling in a Computer System'. Together they form a unique fingerprint.

Cite this