By Topic

Process Scheduling in a Computer System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Z. Rosberg ; Department of Computer Science, Technion-Israel Institute of Technology

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.

Published in:

IEEE Transactions on Computers  (Volume:C-34 ,  Issue: 7 )