By Topic

Exact analysis of round-robin scheduling of services

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
$31 $31
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)
Takagi, Hideaki ; IBM Japan, Ltd., Tokyo Research Laboratory, 5-19 Sanban-cho, Chiyoda-ku, 102, Japan

A multi-queue, cyclic-service model with a single-message buffer is considered. Each message consists of a number of characters, and one character is served at the server's each visit. Exact and explicit expressions are derived for performance measures, such as mean cycle time, mean message response time, and mean response time conditioned on the message length. The same model was previously solved by approximation by Wu and Chen [IBM J. Res. Develop. 19, No. 5, 486-493 (September 1975)].

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:31 ,  Issue: 4 )