Performance and Reliability Analysis Using Directed Acyclic Graphs

IEEE Transactions on Software Engineering

Volumn SE-13, Issue 10, 1987, Pages 1105-1114

  Sahner, Robin A ^a   Trivedi, Kishor S ^b  

^a Gould Computer Systems Division ^*  (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

Availability; directed acyclic graphs; fault tolerance; Markov models; performance evaluation; program performance; reliability

Indexed keywords

EID: 33750646143     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1987.232852     Document Type: Article

References (27)

1. S. Bavuso, P. Peterson, and D. Rose, Care III model overview and users guide, NASA Tech. Memo. 85810, June 1984
2. E. G. Coffman, Computer and Job/Shop Scheduling. New York: Wiley, 1976.
3. D. R. Cox, “The use of Complex probability in the theory of stochastic processes,” Proc. Cambridge Philosophical Soc., vol. 51, pp. 313–319, 1955.
4. H. E. David, Order Statistics. New York: Wiley, 1981.
5. B. Dodin, “Bounding the project completion time distribution in PERT networks,” Oper. Res., vol. 33, no. 4, pp. 862–881, July-Aug. Aug. 1985.
6. J. B. Dugan, K. S. Trivedi, R. M. Geist, and V. F. Nicola, “Extended stochastic Petri nets: Analysis and applications,” in PERFORMANCE ‘84. Paris: North-Holland, Dec. 1984.
7. J. L. Fleming, “Relcomp: A computer program for calculating system reliability and MTBF,’ IEEE Trans. Rel., vol. R-20, pp. 102–107, 107, Aug. 1971.
8. H. Frank, “Shortest paths in probabilistic graphs,” Oper. Res., vol. 17, no. 4, pp. 583–599, July-Aug. 1969.
9. H. Hartley and A. Wortham, “Statistical theory for PERT critical path analysis,” Management Sci., vol. 12, no. 1, pp. B-469-481, June 1966.
10. W. Kleinoder, “Evaluation of task structures for a hierarchical multiprocessor system,” in Proc. Int. Conf. Modeling Techniques and Tools for Performance Analysis, May 1984.
11. K. C.-Y. Kung, “Concurrency in parallel processing systems,” Ph.D. dissertation, Dep. Comput. Sci., Univ. California, Los Angeles, 1984.
12. E. L. Lawler, “Sequencing jobs to minimize total weighted completion time subject to precedence constraints,” Ann. Discrete Math., vol. 2, pp. 75–90, 1978.
13. J. Martin, “Distribution of the time through a directed acyclic network,” Oper. Res., vol. 13, pp. 44–66, 1965.
14. M. Modarres, “A method of predicting availability characteristics of series-parallel systems,” IEEE Trans. Rel., vol. R-33, no. 4, pp. 308–312, 312, Oct. 1984.
15. Y.-W. Ng and A. Avizienis, “A model for transient and permanent fault recovery in closed fault-tolerant systems,” in Proc. 1976 Int. Symp. Fault-Tolerant Computing, June 1976.
16. L. Ringer, “Numerical operators for statistical PERT critical path analysis,” Management Sci., vol. 16, no. 2, pp. B-136-143, Oct. 1969.
17. J. Riordan, Combinatorial Identities. New York: Wiley, 1968.
18. J. T. Robinson, “Some analysis techniques for asynchronous multiprocessor algorithms,” IEEE Trans. Software Eng., vol. SE-5, pp. 24–31, Jan. 1979.
19. R. Sahner, “A hybrid, combinatorial-Markov method of solving performance and reliability models,” Ph.D. dissertation, Dep. Comput. Sci., Duke Univ., 1986.
20. R. D. Schlichting, “A technique for estimating performance of faulttolerant tolerant programs,” IEEE Trans. Software Eng., vol. SE-11, pp. 555–563, 563, June 1985.
21. M. Shooman, Probabilistic Reliability, An Engineering Approach. New York: McGraw-Hill, 1968.
22. C. Sigal, A. Pritsker, and J. Solberg, “The stochastic shortest route problem,” Oper. Res., vol. 28, no. 5, pp. 1122–1129, Sept.-Oct. 1980.
23. K. Takamizawa, T. Nishizeki, and N. Saito, “Linear-time computability of combinatorial problems on series-parallel graphs,” JACM, vol. 29, no. 3, pp. 623–641, July 1982.
24. D. F. Towsley, J. C. Browne, and K. M. Chandy, “Models for parallel processing within programs,” Commun. ACM, vol. 21, no. 10, pp. 821–831, Oct. 1978. Commun.
25. K. S. Trivedi, Probability and Statistics with Reliability, Queuing and Computer Science Applications. Edgewood Cliffs, NJ: Prentice-Hall, 1982.
26. J. Valdes, R. E. Tarjan, and E. L. Lawler, “The recognition of series-parallel digraphs,” Siam J. Comput., vol. 11, no. 2, pp. 298–313, 313, 1982.
27. A. T. Wei and R. H. Campbell, “Construction of a fault tolerant real-time time software systems,” Univ. Illinois, Tech. Rep. UIUCDCS-R-80-1042, 1042, Dec. 1980.