By Topic

Central Server Model for Multiprogrammed Computer Systems with Different Classes of Jobs

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 $33
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)
We-Min Chow ; IBM Thomas J. Watson Research Center, Yorktown Heights, New York, 10598, USA

A computer system can usually be interpreted as a closed network with two different types of servers. It is then possible to convert the network into a single server system with state-dependent arrivals. This paper investigates the stationary behavior of a single server queue with different classes of jobs. It is assumed that the input process has state-dependent exponential inter-arrival times and preemptions at the server are not allowed. The exact solution is obtained by finding the relationship between the time average probability distribution and the departure average probability distribution. The latter can be derived, based upon an imbedded Markov Chain.

Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.  

Published in:

IBM Journal of Research and Development  (Volume:19 ,  Issue: 3 )