• DocumentCode
    934587
  • Title

    Queueing network model of interactive computing systems

  • Author

    Chen, Peter Pin-Shan

  • Volume
    63
  • Issue
    6
  • fYear
    1975
  • fDate
    6/1/1975 12:00:00 AM
  • Firstpage
    954
  • Lastpage
    957
  • Abstract
    A closed queueing network model with state dependent routing probabilities is developed for the study of interactive computing systems which use swapping as a memory managmnent strategy. An algorithm to obtain an approximate solution of the mathematical model is proposed. Based on meamuements of a dual-processor PDP-10 system, the model is found to be better in predicting the system performance than the classical model without state dependent routing probabilities.
  • Keywords
    Computer network management; Computer networks; Management information systems; Mathematical model; Memory management; Predictive models; Routing; Scheduling algorithm; Technology management; Time sharing computer systems;
  • fLanguage
    English
  • Journal_Title
    Proceedings of the IEEE
  • Publisher
    ieee
  • ISSN
    0018-9219
  • Type

    jour

  • DOI
    10.1109/PROC.1975.9860
  • Filename
    1451790