Computer Sciences Dept.

CS 747: Advanced Computer Systems Analysis Techniques

Spring 2011
Instructor: Prof. Mary Vernon

TR 2:30-3:45p in 1289 Computer Sciences


Course Text

[LZGS] E. D. Lazowska, J. Zahorjan, G. S. Graham, K. C. Sevcik,
Quantitative System Performance, Prentice Hall, 1984.

This text is available online.


Other Useful Texts

  • Bruell, Steven C. and Gianfranco Balbo,
    Computational algorithms for closed queueing networks, North Holland, New York, 1980.

    ISBN: 0444004211, available in the UW Math Library Call Number: T57.9 B78

  • Kleinrock, L., Queueing Systems Volume I: Theory, Wiley Interscience, 1975. (Chapters 2,3)


Queueing Theory Tutor


This on-line tutorial contains a simulation of the M/M/1 queue that illustrates the bursty Poisson arrivals and the time it takes for the queue to empty when a backlog builds up (i.e., the busy period behavior).

Selected Papers

Product-Form or Separable Queueing Networks

AMVA Approximations

AMVA Applications

Further Customized Performance Models

Open vs Closed Workloads

Applications of Markov Chains

  • Greenberg, A. G., I. Mitrani, and L. Rudolph, "Analysis of Snooping Caches", Proc. Performance '87 12th Int'l. Symp. on Computer Performance, Dec. 1987, pp. 345-361. (AT&T Technical Memorandum)

  • May, M., J.-C. Bolot, A. Jean-Marie and C. Diot, "Simple Performance Models of Differentiated Services Schemes for the Internet", Proc. IEEE INFOCOM '99 18th Ann. Joint Conf. of the IEEE Computer and Communications Societies, Vol. 3, New York, March 1999, pp. 1385-1394.

 
Computer Sciences | UW Home