Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
426367 | Future Generation Computer Systems | 2006 | 10 Pages |
Abstract
Semi-Markov processes (SMPs) are expressive tools for modelling parallel and distributed systems; they are a generalisation of Markov processes that allow for arbitrarily distributed sojourn times. This paper presents an iterative technique for transient and passage time analysis of large structurally unrestricted semi-Markov processes. Our method is based on the calculation and subsequent numerical inversion of Laplace transforms and is amenable to a highly scalable distributed implementation. Results for a distributed voting system model with up to 1.1 million states are presented and validated against simulation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jeremy T. Bradley, Nicholas J. Dingle, Peter G. Harrison, William J. Knottenbelt,