1
Q
M/M/1
A
- Poisson arrivals, exponential service time, 1 server, infinite queue
2
Q
Probability of j requests in an M/M/1 system
A
- rho^j * (1 - rho)
- j ~ Geometric(1- rho)
3
Q
The average number of requests in an M/M/1 system at steady-state
A
- q = rho / (1 - rho)
4
Q
The average number of items waiting in the queue in an M/M/1 system at steady state
A
- Solve for w from the equation q = w + rho
5
Q
Slowdown in an M/M/1 System
A
- 1 / (1 - rho)
CS350
flashcards
Decks in class (18)
# Cards
-
2. A Bird's Eye View of System Abstractions14
-
3. Processes as Resource Consumers9
-
4. Performance Metrics and Perspectives24
-
5. Performance Evaluation and Models14
-
7. Basic Probability Analysis5
-
8. Probability Distributions as Modeling Tools6
-
9. Elementary Queuing Analysis5
-
11. Variations of the M/M/1 Queuing System3
-
12. Networks of Queues6
-
13. From M/M/1 to GPS11
-
14. Basic Resource Scheduling20
-
15. Length-Aware Job Scheduling16
-
16. State-Aware Resource Management18
-
17. Real-Time Scheduling13
-
18. Multi-Resource Scheduling6
-
19. Mutual Exclusion11
-
20. Hardware Assisted Synchronization7
-
21. Deadlock Management13
