This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
October 1987 (vol. 13 no. 10)
pp. 1105-1114
R.A. Sahner, Gould Computer Systems Division
A graph-based modeling technique has been developed for the stochastic analysis of systems containing concurrency. The basis of the technique is the use of directed acyclic graphs. These graphs represent event-precedence networks where activities may occur serially, probabilistically, or concurrently. When a set of activities occurs concurrently, the condition for the set of activities to complete is that a specified number of the activities must complete. This includes the special cases that one or all of the activities must complete. The cumulative distribution function associated with an activity is assumed to have exponential polynomial form. Further generality is obtained by allowing these distributions to have a mass at the origin and/or at infinity. The distribution function for the time taken to complete the entire graph is computed symbolically in the time parameter t. The technique allows two or more graphs to be combined hierarchically. Applications of the technique to the evaluation of concurrent program execution time and to the reliability analysis of fault-tolerant systems are discussed.
Index Terms:
reliability, Availability, directed acyclic graphs, fault-tolerance, Markov models, performance evaluation, program performance
Citation:
R.A. Sahner, K.S. Trivedi, "Performance and Reliability Analysis Using Directed Acyclic Graphs," IEEE Transactions on Software Engineering, vol. 13, no. 10, pp. 1105-1114, Oct. 1987, doi:10.1109/TSE.1987.232852
Usage of this product signifies your acceptance of the Terms of Use.