Skip Navigation

The Computer Journal 1980 23(4):290-297; doi:10.1093/comjnl/23.4.290
© 1980 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Lipsky, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A Study of time sharing systems considered as queueing networks of exponential servers

L. Lipsky *

The queueing theory of exponential servers as applied to time sharing computer systems is discussed in detail with respect to response time and throughput. The restriction that only a fixed number of transactions may be processed simultaneously by the computer subsystem is treated, with comparison made among four different approximations.

Received September 1978. revised October 1979.

* Computer Graphics Group, Informatica, Katholieke Universiteit, Nijmegen, the Netherlands

§ Permanent Address: Department of Computer Science, University of Nebraska, Lincoln, Nebraska 68588, USA.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.