Computing Publications

Publications Home » Truncation of Passage-time Calcul...

Truncation of Passage-time Calculations in Semi-Markov Models

Marcel C. Guenther, Jeremy T. Bradley, Nicholas J. Dingle, William J. Knottenbelt

National Workshop Paper
UKPEW'09, 25th UK Performance Engineering Workshop
July, 2009
pp.17–28
ISBN 978-0-9559703-1-3
Abstract

Calculation of passage time distributions in large semi-Markov models can be accomplished by means of a previously-presented iterative algorithm, the core of which is repeated sparse matrix-vector multiplication. The algorithm's performance is therefore highly dependent on the number of multiplications of matrix and vector elements that must be performed during each iteration. At the same time, the products of matrix and vector elements that are very small contribute little to the overall result of the multiplication. In this paper, we investigate the effect of ignoring these values on both the performance and accuracy of the iterative passage time algorithm. We show that in the models we analyse here this truncation significantly reduces the number of multiplications which must be performed, and hence significantly reduces the running time of the algorithm, with little effect on the accuracy of the final result.

Keywords
AESOP
PDF of full publication (170 kilobytes)
(need help viewing PDF files?)
GZipped Postscript of full publication (134 kilobytes)
(need help viewing GZipped Postscript files?)
PDF of presentation slides (142 kilobytes)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.