Abstract
A communication system of n buffered input terminals, numbered 1,2,3,..., n, connected to a computer by a single channel, is analyzed. The n terminals are serviced according to a SCAN policy: the terminals are polled in sequence 1,2,3,..., n, n, n-1,...,2,1. Data are removed one unit at a time from the terminals’ buffer. Data arriving to the terminal during this time are stored in an auxilliary buffer and are served in the next poll to the terminal. When the buffer has been emptied, the channel is used for system overhead for a randomly determined length of time. The stationary distribution of buffer contents, assumed to exist if the total normalized arrival rate is less than one, is used to find the average buffer contents and the average intervisit time. General, independent arrival rates are assumed for the n terminals. The analysis follows that in Swartz [2].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Coffman, E. G., Jr. and Hofri, M., “On the Expected Performance of Scanning Disks,” SIAM J. Comput., 1981.
Swartz, G. B., “Polling a Loop System,” J. Assoc. Comput. Mach., January 1980, pp. 42-59.
Swartz, G. B., “Polling in a Gated Loop System,” submitted for publication, June 1980.
Hofri, M., “Disk Scheduling: FCFS vs. SSTF Revisited,” Comm. ACM, November 1980, pp. 645-653.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer Science+Business Media New York
About this chapter
Cite this chapter
Swartz, G.B. (1982). Analysis of a Scan Service Policy in a Gated Loop System. In: Disney, R.L., Ott, T.J. (eds) Applied Probability— Computer Science: The Interface. Progress in Computer Science, vol 3. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-5798-1_11
Download citation
DOI: https://doi.org/10.1007/978-1-4612-5798-1_11
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-0-8176-3093-5
Online ISBN: 978-1-4612-5798-1
eBook Packages: Springer Book Archive