Multivariate point process models for response times in multiprogrammed systems

  • David W. Hunter
  • Gerald S. Shedler


We consider the formulation of marked multivariate point process models for job response times in multiprogrammed computer systems. Complementing queueing network representation of the structure of the system to be modeled, the particularR-process (Response time process) model we propose permits representation of resource contention, facilitates the incorporation of realistic workload characteristics into system performance predictions, and can reproduce inhomogeneities observed in running systems. Specification of the structure of theR-process model is conditional on workload marks; this effectively separates the difficult problem of formal representation of workload characteristics from the overall problem of response time prediction. To illustrate these ideas, an application to database management systems is considered. Evidence of the predictive capability of theR-process model, based on statistical analysis of response time data from an IMS system, is also given.

Key words

Performance models multiprogrammed systems response times marked multivariate point processes statistical analysis of trace data database management systems 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    F. Baskett, K. M. Chandy, R. R. Muntz, and F. G. Palacios, “Open, closed, and mixed networks of queues with different classes of jobs,”J. ACM 22:248–260 (1975).Google Scholar
  2. 2.
    E. L. Bradley, “The equivalence of maximum likelihood and weighted least squares estimates in the exponential family,”J. Am. Stat. Assoc. 68:199–200 (1973).Google Scholar
  3. 3.
    J. Buzen, “Queueing Network Models of Multiprogramming,” Ph.D. thesis, Division of Engineering and Applied Physics, Harvard University, Cambridge, Massachusetts (1971).Google Scholar
  4. 4.
    A. Charnes, E. L. Frome, and P. L. Yu, “The equivalence of generalized least squares and maximum likelihood estimates in the exponential family,”J. Am. Stat. Assoc. 71:169–171.Google Scholar
  5. 5.
    D. R. Cox and P. A. W. Lewis, “Multivariate Point Processes,” inProceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, Vol. III, pp. 401–448. University of California Press, Berkeley, California (1972).Google Scholar
  6. 6.
    D. P. Gaver, “Probability models for multiprogrammed computer systems,”J. ACM 14:423–439 (1967).Google Scholar
  7. 7.
    E. Gelenbe and R. R. Muntz, “Probabilistic models of computer systems, Part I (Exact results),”Acta Inform. 7:35–60 (1976).Google Scholar
  8. 8.
    D. L. Iglehart and G. S. Shedler, “Regenerative Simulation of Response Times in Networks of Queues,” IBM Research Report RJ 1740, San Jose, California (1976). To appear inJ. ACM 25 (1978).Google Scholar
  9. 9.
    D. L. Iglehart and G. S. Shedler, “Simulation of Response Times in Finite Capacity Open Networks of Queues,” IBM Research Report RJ 1886, San Jose, California (1976). To appear inOpns. Res. 26 (1978).Google Scholar
  10. 10.
    IBM Corporation, “Information Management System/360, Version 2,” General Information Manual GH20-0765, Armonk, New York (1973).Google Scholar
  11. 11.
    J. R. Jackson, “Jobshop-like queueing systems,”Manage. Sci. 10:131–142 (1963).Google Scholar
  12. 12.
    A. G. Konheim and M. Reiser, “A queueing model with finite waiting room and blocking,”J. ACM 23:328–341 (1976).Google Scholar
  13. 13.
    S. S. Lavenberg and G. S. Shedler, “Stochastic modeling of processor scheduling with application to data base management systems,”IBM J. Res. Dev. 20:437–448 (1976).Google Scholar
  14. 14.
    P. A. W. Lewis and G. S. Shedler, “A cyclic-queue model of system overhead in multiprogrammed computer systems,”J. ACM 18:119–220 (1971).Google Scholar
  15. 15.
    P. A. W. Lewis and G. S. Shedler, “Statistical analysis of non-stationary series of events in a data base system,”IBM J. Res. Dev. 20:465–482 (1976).Google Scholar
  16. 16.
    C. G. Moore III, “Network Models for Large-Scale Time-Sharing Systems,” Technical Report No. 71-1, Department of Industrial Engineering, University of Michigan Ann Arbor, Michigan (1971).Google Scholar
  17. 17.
    M. Reiser and H. Kobayashi, “Queueing networks with multiple closed chains: theory and computational algorithms,”IBM J. Res. Dev. 19:283–294 (1975).Google Scholar
  18. 18.
    D. W. Robinson and P. A. W. Lewis, “Generating Gamma and Cauchy Random Variables: An Extension to the Naval Postgraduate School Random Number Package,” Naval Postgraduate School Report NPS72Ro75041, Monterey, California (1975).Google Scholar

Copyright information

© Plenum Publishing Corporation 1978

Authors and Affiliations

  • David W. Hunter
    • 1
  • Gerald S. Shedler
    • 2
  1. 1.IBM T. J. Watson Research CenterYorktown Heights
  2. 2.IBM Research LaboratorySan Jose

Personalised recommendations