Skip to main content
Log in

Some notes on the queueing analysis of the scan policy of the walking server

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

This paper is concerned with an investigation of the queueing process that arises in service systems with setup times and SCAN motion policy. Existing work results are extended to the case of a general distribution of setup times. A general arrivals partitioning among classes is also assumed. Some discrepancies between existing works are discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. G. Coffman, L. A. Klimko, B. Ryan,Analysis of scanning policies for reducing disk seek times, SIAM J. Comput. (3)1 (1972), 269–279.

    Article  MATH  Google Scholar 

  2. R. W. Conway, W. L. Maxwell L. W. Miller,Theory of scheduling (1967), Addison-Wesley Reading, Mass.

    MATH  Google Scholar 

  3. M. Eisenberg,Two queues with changeover times, Operations Res. (2)19 (1971), 386–401.

    MATH  Google Scholar 

  4. W. C. Oney,Queueing analysis of the SCAN policy for moving head disks, J. Assoc. Comput. Mach. (3)22 (1975), 397–412.

    MATH  MathSciNet  Google Scholar 

  5. C. E. Skinner,A priority queueing system with server-walking time, Operations Res. (2)15 (1967), 278–285.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iazeolla, G.G., Martinelli, E. Some notes on the queueing analysis of the scan policy of the walking server. Calcolo 15, 27–40 (1978). https://doi.org/10.1007/BF02576043

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02576043

Keywords

Navigation