0
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

A Oueueing Model Of A Rotational Position Sensing Disk System

, &
Pages 199-216 | Received 10 Nov 1977, Published online: 25 May 2016

References

  • W.C. Lynch, “Do disk arms move?” Perfor. Eval. Rev., vol. 1, no. 4, 1972.
  • T.G. Price, Probability models of multiprogramming computer systems, PH D thesis, Stanford University, 1975.
  • J.C. Browne, K.M. Chandy, R.M. Brown, T.W. Keller, D.F. Towsley, and CW. Dissly, “Hierarchical techniques for the development of realistic models of complex computer systems, Proc. IEEE, vol. 63, no. 6,1975, 966–975.
  • C.A. Rose, Measurement and analysis for computer performance evaluation, PH D thesis, George Washington University, 1975.
  • D.H. Towsley, Local balance models of computer systems, PH D thesis. University of Texas at Austin, 1975.
  • C.A. Rose, “Validation of a queueing model with classes of customers,” Proc. Int. Symp. on CPMME, 1976, 318–326.
  • L. Kleinrock, Queueing systems. Vol. 1: Theory. New York: Wiley, 1975.
  • J. Abate and H. Dubner, “Optimizing the performance of a drum-like storage,” IEEE Trans. Comp. C-1, vol, 11, 1969, 992–997.
  • N.C. Wilhelm, “A General model for the performance of disk systems, J, ACM, vol, 24, no. 1, 1977, 13–17.
  • S.H. Fuller and F. Baskett, “An analysis of drum storage units,” J. ACM, vol. 22, no, 1, 1975, 83–105.
  • K, Omahen, “Estimating response time for auxiliary memory configurations with multiple movable-head disk modules,” Proc. Int. Conf. on Very Large Data Bases, 1975, 473–495.
  • J.P. Buzen, Queueing network models of multiprogramming, PH D thesis. Harvard University, 1971.
  • J. Zahorjan, “Iterative aggregation with global balance,” Project SAM Notes, Computer Systems Research Group, University of Toronto, February 1977.
  • K.C. Sevcik, A.I, Levy, S.K. Tripathi, and J. Zahorjan, “Improving approximations of aggregated queueing network subsystems,” Proc. Int. Symp. on CPMME, 1976, 1–22.
  • C.H. Sauer and K.M. Chandy, “Approximate analysis of central server models,” IBM J, R&D, vol. 19, no. 3,1975, 301–313,
  • F. Baskett, K.M. Chandy, R.R. Muntz, and F.G. Palacios, “Open, closed and mixed networks of queues with different classes of customers,” J. ACM, vol. 22, no. 2, 1975, 248–260.
  • J. Zahorjan, A Queueing model of rotational position sensing disk storage, MSC Thesis, University of Toronto, 1976.
  • A.I, Levy, QSOLVE: A queueing network solution system, MSC thesis. Technical Note 6, Computer Systems Research Group, University of Toronto, 1977.
  • P.J. Denning, “Effects of scheduling on file memory operations,” Proc. AFIPS, 1967 Spring Joint Computer Conf,, vol. 30, 9–21.
  • N.C. Wilhem, “Analysis of FCFS and SSTF seek scheduling using an empirical model for disc accesses,” Stanford Electronics Laboratories, Standford University, Tech, Rept. 64, 1973, 39 pp.
  • T.J. Teorey and T.B, Pinkerton, “A Comparative analysis of disk scheduling policies, C. ACM, vol. 15, no. 3,1972,177–184.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.