Performability analysis: a new algorithm
Published in IEEE Transactions on Computers • Apr 1, 1996
NobleIDNI6P99W29R33S77
Authors:,
Hédi Nabli
Bruno Séricola
Abstract
We propose, in this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the alg...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!