Mean Value Analysis: A Personal Account

  • M. Reiser
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1769)

Abstract

In 1977, I was manager of a small group “Distributed System Studies” in the Thomas J. Watson Research Center. At that time, ARPANET had already grown into a big US-wide meshed network using innovative technology such as adaptive routing and datagrams. By this comparison, IBM’s System Network Architecture (SNA) was quite backward. It grew out of so called “Telecommunication Access Methods” and was basically a feeding network for a single mainframe complex with tree topology (Fig. 1).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    V. S. Adve, M. D. Hill, and M. K. Vernon. Comparison of hardware and software cache coherence schemes. Proc. 18th Int’l. Symp. on Computer Architecture, Toronto, May 27–30, 1991.Google Scholar
  2. 2.
    V. S. Adve and M. K. Vernon. Performance analysis of multiprocessor mesh interconnection networks with deterministic routing. IEEE Trans. on Parallel and Distributed Systems, 5(3):225–246, March 1994.CrossRefGoogle Scholar
  3. 3.
    Y. Bard. Some extensions to multiclass queueing network analysis. In A. Btrimenko M. Arato and E. Gelenbe, editors, Performance of Computer Systems. North-Holland, 1979.Google Scholar
  4. 4.
    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, 22(3):248–260, April 1975.MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    G. E. Bier and M. K. Vernon. Measurement and prediction of contention in multiprocessor operating systems with scientific application workloads. In Proc. 1988 Int’l. Conf. on Supercomputing, pages 9–15, St. Malo, France, July 4–8 1988.Google Scholar
  6. 6.
    J. P. Buzen. Computational algorithms for closed queueing networks with exponential servers. Communications of the ACM, 16(9):527–531, September 1973.MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    K. M. Chandy and D. Neuse. Linearizer: a heuristic algorithm for queueing network models of computing systems. Communications of the ACM, 25(2):126–134, February 1982.CrossRefGoogle Scholar
  8. 8.
    A. E. Conway and N. D. Georganas. Recal: A new efficient algorithm for the exact analysis of multiple-chain closed queueing networks. J. ACM, 33(4):768–791, 1986.MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    A. E. Conway and N. D. Georganas. Queueing Networks-Exact Computational Algorithms: A Unified Theory Based on Decomposition and Aggregation. The MIT Press, Cambridge, Mass., 1989.Google Scholar
  10. 10.
    P. G. Harrison and N. M. Patel. Performance Modeling of Communication Networks and Computer Architectures. Addison-Wesley, 1992.Google Scholar
  11. 11.
    J. R. Jackson. Jobshop-like queueing systems. Management Science, 10(1):131–142, 1963.CrossRefGoogle Scholar
  12. 12.
    R. Jain. The Art of Computer Systems Performance Analysis. John Wiley and Sons, 1991.Google Scholar
  13. 13.
    P. J. B. King. Computer and Communication Systems Performance Modeling. Prentice Hall, 1990.Google Scholar
  14. 14.
    L. Kleinrock. Queueing Systems, volume 1. J. Wiley & Sons, 1975.Google Scholar
  15. 15.
    S. S. Lavenberg and M. Reiser. Stationary state probabilities of arrival instants for closed queueing networks with multiple types of customers. J. Applied Probability, 17:1048–1061, 1980.MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    E. D. Lazowska, J. Zahorjan, G. S. Graham, and K. C. Sevcik. Quantitative System Performance. Prentice Hall, 1984.Google Scholar
  17. 17.
    S. T. Leutenegger and M. K. Vernon. A mean value performance analysis of a new multiprocessor architecture. In Proc. 1988 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 167–176, Santa Fe, New Mexico, May 24–27 1988.Google Scholar
  18. 18.
    D. A. Menasce and V. A. F. Almeida. Capacity Planning for Web Performance, Metrics, Models and Methods. Prentice Hall, 1998.Google Scholar
  19. 19.
    D. A. Menasce, V. A. F. Almeida, and L. W. Dowdy. Capacity Planning and Performance Modeling, from Mainframes to Client-Server Systems. Prentice Hall, 1994.Google Scholar
  20. 20.
    S. Owicki and A. Agarwal. Evaluating the performance of software cache coherence. In Proc. 3rd Int’l. Conf. on Architectural Support for Prog. Lang. and Systems, pages 230–242, Boston, April 1989.Google Scholar
  21. 21.
    J. Patel, M. J. Carey, and M. K. Vernon. Accurate modeling of the hybrid hash join algorithm. In ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 56–66, Nashville, TN, June 1994.Google Scholar
  22. 22.
    M. Reiser. Mean value analysis of queueing networks, a new look at an old problem. In Proc. 4th Intl. Symp. on Modeling and Performance Evaluation of Computer Systems, Vienna, 1979. North Holland.Google Scholar
  23. 23.
    M. Reiser. A queueing network analysis of computer communication networks with window flow control. IEEE Transactions on Communications, COM-27(8):1199–1209, August 1979.CrossRefMathSciNetGoogle Scholar
  24. 24.
    M. Reiser. Mean value analysis and convolution method for queue-dependent servers in closed queueing networks. Performance Evaluation, 1(1):7–18, 1981.CrossRefMATHMathSciNetGoogle Scholar
  25. 25.
    M. Reiser and H. Kobayashi. Queueing networks with multiple closed chains: Theory and computational algorithms. IBM J. of Research and Development, 19(3):282–294, May 1975.MathSciNetGoogle Scholar
  26. 26.
    M. Reiser and S. S. Lavenberg. Mean-value analysis of closed multichain queueing networks. J. ACM, 27(2):313–322, April 1980.MATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    C. H. Sauer. Computational algorithms for state-dependent queueing networks. ACM Transactions on Computer Systems, 1(1):67–92, February 1983.CrossRefMathSciNetGoogle Scholar
  28. 28.
    P. J. Schweitzer. Approximate analysis of multiclass closed networks of queues. In Proc. International Conf. on Stochastic Control and Optimization, 1979.Google Scholar
  29. 29.
    P. J. Schweitzer, G. Serazzi, and M. Broglia. A queue-shift approximation technique for product-form queueing networks. In Proc. of Int.l Conf. on Computer Performance Evaluation, Modelling Techniques and Tools, LNCS 1469, pages 267–279, 1998.Google Scholar
  30. 30.
    K. C. Sevcik and I. Mitrani. The distribution of queueing network states at input and output instants. In Proc. 4th Internat. Symp. Modeling and Performance Evaluation of Computer Systems. North Holland, 1979.Google Scholar
  31. 31.
    K. C. Sevcik and I. Mitrani. The distribution of queueing network states at input and output instants. J. ACM, 28(2):358–371, April 1981.MATHCrossRefMathSciNetGoogle Scholar
  32. 32.
    D. J. Sorin, V. S. Pai, S. V. Adve, M. K. Vernon, and D. A. Wood. Analytic evaluation of shared-memory parallel systems with ILP processors. In Proc. 25th Int’l. Symp. on Computer Architecture (ISCA’ 98), pages 380–391, 712–727, Barcelona, Spain, July 1998.Google Scholar
  33. 33.
    T. Tsuei and M. K. Vernon. A model of multiprocessor memory and bus interference validated by system measurement. IEEE Trans. on Parallel and Distributed Systems, Special Issue on Measurement and Evaluation of Parallel and Distributed Systems, November 1992.Google Scholar
  34. 34.
    M. K. Vernon, R. Jog, and G. Sohi. Analysis of hierarchical cache-coherent multi-processors. Performance Evaluation, 9(4), 1989.Google Scholar
  35. 35.
    M. K. Vernon, E. D. Lazowskanw, and J. Zahorjan. An accurate and efficient performance analysis technique for multiprocessor snooping cache-consistency protocols. In Proc. 15th Int’l. Symp. on Computer Architecture, pages 308–315, Honolulu, Hawaii, May 30–June 2 1988.Google Scholar
  36. 36.
    G. M. Voelker, H. A. Jamrozik, M. K. Vernon, H. M. Levy, and E. D. Lazowska. Managing server load in global memory systems. In Proc. 1997 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 127–138, Seattle, WA, June 1997.Google Scholar
  37. 37.
    D. L. Willick and D. L. Eager. An analytical model of multistage interconnection networks. In Proc. 1990 ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 192–199, Boulder, Colorado, May 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • M. Reiser
    • 1
  1. 1.GMDGerman National Research Center for Information TechnologySankt AugustinGermany

Personalised recommendations