By Topic

Performability analysis of distributed real-time systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Islam, S.M.R. ; IBM Corp., Boca Raton, FL, USA ; Ammar, H.H.

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(Nmax3), where Nmax 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

Published in:

Computers, IEEE Transactions on  (Volume:40 ,  Issue: 11 )