Advertisement

Acta Informatica

, Volume 11, Issue 2, pp 103–117 | Cite as

An experimentally validated model of the paging drum

  • C. Adams
  • E. Gelenbe
  • J. Vicard
Article

Summary

The behaviour of the paging drum or disc has a significant impact on the performance of multiprogrammed, paging systems. A study is made of such devices using the three tools of performance evaluation: an analytical model, a simulation model and empirical measurements. The models extend previous studies by including non-exponential arrival times and a comparison is made between the proposed analytical model and standard models using Poisson arrivals.

Keywords

Information System Operating System Simulation Model Data Structure Arrival Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adams, J.C., Millard, G.E.: Performance measurements on the Edinburgh multi-access system. Proceedings ICS-75 at Antibes, France 1975Google Scholar
  2. 2.
    Badel, M.: Quelques problèmes liés à la simulation de modèles de systèmes informatiques. Thèse de Docteur-Ingénieur, Université de Paris VI, 1975Google Scholar
  3. 3.
    Badel, M., Shum, A.V.Y.: Accuracy of an approximate computer system model. In: Modelling and performance evaluation of computer systems (E. Gelenbe, H. Beilner, eds.). Amsterdam: North Holland 1976Google Scholar
  4. 4.
    Baudet, G., Ferrié, J., Boulanger, J.: Analysis of a drum with bulk arrivals. International Computing Symposium, pp. 213–224. Amsterdam: North Holland 1975Google Scholar
  5. 5.
    Coffman, E.C., Jr.: Analysis of a drum input/output queue under scheduled operation in a paged computer system. J. Assoc. Comput. Mach. 16, 73–90 (1969)Google Scholar
  6. 6.
    Fishman, G.S.: Concepts and methods in discrete event digital simulation. New York: Wiley 1973Google Scholar
  7. 7.
    Gelenbe, E.: On approximate computer system models. J. Assoc. Comput. Mach. 22, 261–269 (1975)Google Scholar
  8. 8.
    Gelenbe, E., Lenfant, J., Potier, D.: Analyse d'un algorithme de gestion simultanée mémoire centrale-disque de pagination. Acta Informat. 3, 321–345 (1974)Google Scholar
  9. 9.
    Gelenbe, E., Lenfant, J., Potier, D.: Response time of a fixed-head disk to transfers of variable length. SIAM J. Comput. 4, 461–473 (1975)Google Scholar
  10. 10.
    Gelenbe, E.: Paging drum statistics with general interarrival times. Unpublished paper, 1976Google Scholar
  11. 11.
    Gelenbe, E., Yasnogorodsky, R.: A queue with server of walking type (autonomous service). To appearGoogle Scholar
  12. 12.
    Kobayashi, H.: Applications of the diffusion approximation to queueing networks: Equilibrium queue distributions. J. Assoc. Comput. Mach. 21, 316–328 (1974)Google Scholar
  13. 13.
    Le Gall, P.: Convergences des simulations et applications aux réseaux téléphoniques. AFIRO Monographies de Recherche Opérationnelle, n∘7 (1968)Google Scholar
  14. 14.
    Mémoires auxiliaires à disques magnétiques DIAD: CII manuel C90097 98 (1973)Google Scholar
  15. 15.
    Whitfield, H., Wight, A.S.: EMAS-The Edinburgh multi-access system. B.C.S. Comput. J. 16, 331–346 (1973)Google Scholar

Copyright information

© Springer-Verlag 1979

Authors and Affiliations

  • C. Adams
    • 1
  • E. Gelenbe
    • 2
  • J. Vicard
    • 3
  1. 1.Computer Science DepartmentUniversity of EdinburghEdinburghScotland
  2. 2.Laboratoire de Recherche en InformatiqueUniversité de Paris-SudOrsay Cédex
  3. 3.Department d'InformatiqueI.U.T., Université Paris-NordVilletaneuseFrance

Personalised recommendations