@MISC{09queueingnetwork, author = {}, title = {QUEUEING NETWORK}, year = {2009} }
Share
OpenURL
Abstract
1. If you haven’t turned in the Entrance Exam, then you’re not on my email list. Please turn it in! 2. To brush up on probability, I recommend that you do all the problems and examples in the first 3 chapters of Sheldon Ross ’ book [5], or equivalent. 3. Please read the course web page: www.cs.cmu.edu/∼harchol/Perfclass/class09fall.html to get info on homeworks and to get lecture notes. 4. This course is cumulative. At this point you should spend at least 2 hours before each class reviewing the material from the previous class. Later you will need 3 hours or more of review per lecture. 2 Where we’re heading Queueing theory is the study of queueing behavior in networks and systems. Figure 1 shows the solution process. Model as Real−world system with question: "Should we buy faster disk or faster CPU?"