CS 547: Texts and Other Readings

Fall 2000

Required Course Texts:

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

Other Useful Texts:

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

ISBN:               0444004211
OCLC:               (OCoLC)06356434
Location:           Math Library
Call Number:        T57.9 B78

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).

DoIT Handouts

Selected papers will be made available at the DoIT Tech Store (first floor of CS&S) as the semester progresses.

vernon@cs.wisc.edu