CSE 221: Probabilistic Analysis of Computer Systems Topics covered: Analysis of software reliability and performance

 Motivation:  Two types of applications:

Terminating application  Definition:  Expected or average time taken for one run of the application:

Terminating application (contd..)  Example:  Control flow graph:

Terminating application (contd..)  Mapping control flow graph to DTMC:

Terminating application (contd..)  Transition probability matrix of DTMC:  Partition of matrix P, resulting in matrix Q:  Computation of fundamental matrix, M:

Terminating application (contd..)  Average number of visits to states:  Time spent in each module:  Average time to complete:

Non-terminating application  Definition:  Expected or average application reliability:

Non-terminating application (contd..)  Example:  Control flow graph:  Mapping control flow graph to DTMC:

Non-terminating application (contd..)  Computation of steady state probabilities:

Non-terminating application (contd..)  Steady state probabilities:  Module reliabilities:  Expected or average reliability of the application: