| |
Course Syllabus
Description:
This course will develop the mathematical tools used to analyze the performance and reliability
of computer systems and networks
Student Work:
- Approximately 7 to 10 problem sets of 1 to 6 problems. Homework will generally be due one
week after being assigned. Assignments should be neat and well organized; sloppy work
will be significantly marked down. Each problem should include a statement of the facts
of the problem, what quantity you are seeking, the details of your solution and the result.
Dimensions (failures/hr, hours, repairs/hour, etc.) should be included with all numeric
quantities.
- Two tests.
- Final exam.
Grades: Will be calculated from grades received for assignments (10%), tests
(test 1 - 25%; test 2 - 25%) and final exam (40%).
Topics
Probability Review
Reliability models:
- Reliability Block (Logic) Diagram Analysis
- Fault Trees
Markov Models:
- Discrete Time Markov Chains
- Poisson Processes
- Continuous Time Markov Chains
- Reliability and Availability Models
- Queuing Systems
- Queuing Network Models
- Performance Models
- Performability (combined reliability and performance) models
Basic Bibliography
Required:
- Vidyadhar G. Kulkarni, Modeling and Analysis of Stochastic Systems, Chapman & Hall, 1995
|
|
|