Performance and Reliability Analysis Using Directed Acyclic Graphs.
DUKE UNIV DURHAM NC DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
A computer powerful model for the stochastic analysis of directed acyclic graphs is developed. These graphs represent event-precedence networks where events may occur serially, probabilistically, or concurrently. When a set of events occurs concurrently, the condition for the set of events to complete is that any specified number of the events must complete. This includes the special cases that one or all of the events complete. The distribution function associated with an event is assumed to have exponential polynomial form. Further generality is obtained by allowing these distributions to have a mass at the origin andor at infinity. The distribution function for the time taken to complete the entire graph is computed in a semi-symbolic form. Applications of the model for the evaluation of concurrent program execution time and to the reliability analysis of fault-tolerant systems are discussed. Additional keywords fault trees nodes SPADE computer program SPADESeries Parallel Directed Acyclic Graph Evaluators.
- Computer Programming and Software
- Computer Systems