Skip to main content

From the Central Server Model to BEST/1©

  • Chapter
  • First Online:
Performance Evaluation: Origins and Directions

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1769))

  • 852 Accesses

Abstract

The central server model [3] represented a major advance in computer performance analysis when it was first introduced. Earlier mathematical models had investigated the performance of individual system components such as central processors, disks and drums. Because they analyzed these components in isolation, early models had no way to represent the powerful interactions that take place among components and ultimately determine overall system performance.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baskett, F., Chandy, K. M., Muntz, R. R., and Palacios, J.: Open, closed, and mixed networks with different classes of customers. J. ACM 22,2 (April 1975), 248–260.

    Article  MATH  MathSciNet  Google Scholar 

  2. Brandwajn, A.: A model of a time sharing system solved using equivalence and decomposition methods. Acta Informatica 4,1 (1974), 11–47.

    Article  MATH  MathSciNet  Google Scholar 

  3. Buzen, J. P.: Queuing network models of multiprogramming. Ph.D. Dissertation, Harvard University, Cambridge, Massachusetts, 1971.

    Google Scholar 

  4. Buzen, J. P.: Computational algorithms for closed queuing networks with exponential servers. C. ACM 15,9 (September 1973), 527–531.

    Article  MathSciNet  Google Scholar 

  5. Buzen J. P.: Fundamental operational laws of computer system performance. Acta Informatica 7,2 (1976), 167–182.

    Article  MATH  MathSciNet  Google Scholar 

  6. Courtois, P. J.: Decomposability: queuing and computer system applications. Academic Press, New York, 1977.

    Google Scholar 

  7. Denning, P. J., and Buzen, J. P.: The operational analysis of queuing network models. ACM Computing Surveys 10,3 (September 1978), 225–261.

    Article  MATH  Google Scholar 

  8. Reiser, M., and Kobayshi, H.: Queuing networks with multiple closed chains: theory and computation algorithms. IBM J. Res. Dev. 19 (May 1975),283–294.

    Article  MATH  Google Scholar 

  9. Suri, R., Diehl, G. W. W., de Treville, S., Tomsicek, M. J.: From CAN-Q to MPX: Evolution of Queuing Software for Manufacturing. OR/MS Interfaces 25,9 (September 1995), 128–150.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Buzen, J.P. (2000). From the Central Server Model to BEST/1©. In: Haring, G., Lindemann, C., Reiser, M. (eds) Performance Evaluation: Origins and Directions. Lecture Notes in Computer Science, vol 1769. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46506-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-46506-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67193-0

  • Online ISBN: 978-3-540-46506-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics