Abstract
A computer center which serves as a data base for many independent users is bound to create a variety of queuing situations. For efficient operation, it is essential to treat individual requests asynchronously, as far as this is possible. Thus, the user messages do not only compete for the central processing unit (CPU) as a server, but also for the data storage devices and for the data transmission channels. Both devices and channels can only be devoted to one action at a time, and other requests for service arriving during this time have to wait.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Everling, W. (1975). Queuing for data accesses. In: Exercises in Computer Systems Analysis. Lecture Notes in Computer Science, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021171
Download citation
DOI: https://doi.org/10.1007/BFb0021171
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07401-4
Online ISBN: 978-3-540-37910-2
eBook Packages: Springer Book Archive