Hypergraph-based parallel computation of passage time densities in large semi-Markov models

Linear Algebra and Its Applications

Volumn 386, Issue 1-3 SUPPL., 2004, Pages 311-334

  Bradley, Jeremy T ^a   Dingle, Nicholas J ^a   Knottenbelt, William J ^a   Wilson, Helen J ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Hypergraph partitioning; Passage time densities; Semi Markov chains

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; ITERATIVE METHODS; MARKOV PROCESSES; MATHEMATICAL MODELS;

HYPERGRAPH PARTITIONING; PASSAGE TIME DENSITIES; SEMI MARKOV CHAINS; WORKLOADS;

GRAPH THEORY;

EID: 2942627865     PISSN: 00243795     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.laa.2003.12.018     Document Type: Conference Paper

References (24)

1. Pyke R. Markov renewal processes: definitions and preliminary properties. Ann. Math. Statist. 32(December):1961;1231-1242.
2. N.J. Dingle, P.G. Harrison, W.J. Knottenbelt, Response time densities in Generalised Stochastic Petri Net models, in: Proceedings of the 3rd International Workshop on Software and Performance (WOSP'2002), Rome, July 2002, pp. 46-54.
3. P.G. Harrison, W.J. Knottenbelt, Passage-time distributions in large Markov chains, in: M. Martonosi, E. de Souza Silva (Eds.), Proceedings of ACM SIGMETRICS S002, Marina Del Rey, USA, June 2002, pp. 77-85.
4. Katoen J.-P., Kwiatkowska M., Norman G., Parker D. Faster and symbolic CTMC model checking. de Alfaro L., Gilmore S. PAPM-PROBMIV 2001, Proceedings of Process Algebra and Probabilistic Methods. Lecture Notes in Computer Science. vol. 2165:2001;23-38 Springer-Verlag, Aachen.
5. Bradley J.T., Davies N.J. A matrix-based method for analysing stochastic process algebras. Rolim J.D.P. ICALP Workshops 2000, Process Algebra and Performance Modelling Workshop, University of Waterloo, Ont., Canada. 2000;579-590 Carleton Scientific, Geneva.
6. R. German, D. Logothetis, K.S. Trivedi, Transient analysis of Markov regenerative stochastic Petri nets: a comparison of approaches, in: PNPM'95, Proceedings of Petri Nets and Performance Models, Durham, NC, 1995, pp. 103-112.
7. Infante López G.G., Hermanns H., Katoen J.-P. Beyond memoryless distributions: model checking semi-Markov chains. de Alfaro L., Gilmore S. PAPM-PROBMIV 2001, Proceedings of Process Algebra and Probabilistic Methods. Lecture Notes in Computer Science. vol. 2165:2001;57-70 Springer-Verlag, Aachen.
8. Bradley J.T., Dingle N.J., Harrison P.G., Knottenbelt W.J. Distributed computation of passage time quantiles and transient state distributions in large semi-Markov models. in: Performance Modelling, Evaluation and Optimization of Parallel and Distributed Systems. 2003;IEEE Computer Society Press, Nice.
9. Abate J., Choudhury G.L., Whitt W. On the Laguerre method for numerically inverting Laplace transforms. INFORMS J. Comput. 8(4):1996;413-427.
10. Abate J., Whitt W. The Fourier-series method for inverting transforms of probability distributions. Queueing Syst. 10(1):1992;5-88.
11. Catalyürek U.V., Aykanat C. Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Trans. Parallel Distrib. Syst. 10(July):1999;673-693.
12. Bolch G., Greiner S., de Meer H., Trivedi K.S. Queueing Networks and Markov Chains. 1998;Wiley.
13. Melamed B., Yadin M. Randomization procedures in the computation of cumulative-time distributions over discrete state Markov processes. Oper. Res. 32(July-August):1984;926-944.
14. Muppala J.K., Trivedi K.S. Numerical transient analysis of finite Markovian queueing systems. Bhat U.N., Basawa I.V. Queueing and Related Models. 1992;262-284 Oxford University Press.
15. H.J. Wilson, Convergence and correctness of an iterative scheme for calculating passage times in semi-Markov processes, Tech. Rep., 2004/1, Department of Applied Maths, University of Leeds, Woodhouse Lane, Leeds, LS2 9JT, UK, February, 2004, http://www.doc.ic.ac.uk/~jb/reports/abstract.html#2004- wilson-0.
16. Abate J., Whitt W. Numerical inversion of Laplace transforms of probability distributions. ORSA J. Comput. 7(1):1995;36-43.
17. G. Karypis, V. Kumar, Multilevel k -way hypergraph partitioning, Tech. Rep. #98-036, University of Minnesota, 1998.
18. W.J. Knottenbelt, Generalised Markovian analysis of timed transitions systems, MSc thesis, University of Cape Town, South Africa, July 1996.
19. W.J. Knottenbelt, Parallel performance analysis of large Markov models, PhD thesis, Imperial College, London, UK, February 2000.
20. Knottenbelt W.J., Harrison P.G., Mestern M.S., Kritzinger P.S. A probabilistic dynamic technique for the distributed generation of very large state spaces. Perform. Eval. 39(February):2000;127-148.
21. Deavours D.D., Sanders W.H. An efficient disk-based tool for solving very large Markov models. in: TOOLS 1997, Computer Performance Evaluation: Modelling Techniques and Tools. Lecture Notes in Computer Science. vol. 1245:1997;58-71 Springer-Verlag, St. Malo.
22. W.J. Knottenbelt, P.G. Harrison, Distributed disk-based solution techniques for large Markov models, in: NSMC'99, Proceedings of the 3rd International Conference on the Numerical Solution of Markov Chains, Zaragoza, September 1999, pp. 58-75.
23. Gropp W., Lusk E., Skjellum A. Using MPI: Portable Parallel Programming with the Message Passing Interface. 1994;MIT Press, Cambridge, MA.
24. Bradley J.T., Dingle N.J., Knottenbelt W.J., Harrison P.G. Performance queries on semi-Markov stochastic Petri nets with an extended Continuous Stochastic Logic. Ciardo G., Sanders W. PNPM'03, Proceedings of Petri Nets and Performance Models, University of Illinois at Urbana-Champaign. 2003;62-71 IEEE Computer Society.