Performability analysis of distributed real-time systems

摘要

An algorithm and a methodology for the performability analysis of repairable distributed real-time systems are presented. The planning cycle of a real-time distributed system, which normally consists of several task invocations, is first identified. The performability distribution at the end of the planning cycle is determined by repeated convolutions of performability densities between task invocations. These convolution operations are efficiently carried out using the operational properties of Laguerre coefficients. The algorithm numerically determines both moments and distribution of performability in O(N/sub max//sup 3/), where N/sub max/ is the largest size of the state space between any task invocations. To illustrate the overall methodology, a simplified example of a radar system is analyzed, and the various performability measures are obtained using the algorithm.