By Topic

Performability analysis of distributed real-time systems with repetitive task invocation

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
$33 $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)
S. M. R. Islam ; IBM Corp., Boca Raton, FL, USA ; H. H. Ammar

An algorithm and a methodology for the performability analysis of a class of repairable distributed real-time systems are presented. Distributed real-time workloads generally consist of repetitive concurrent tasks with known cycle and deadline times. The planning cycle of real-time distributed systems, which normally consists of several task invocations, is first identified. A repairable distributed real-time system that can be described by a cyclic Markov reward model between invocation tasks is considered. The performability distribution at the end of the planning cycle is determined by performing repeated convolution of performability densities between task invocations. This convolution operation is efficiently done using the Laguerre coefficients. The algorithm numerically determines both moment and distribution of performability in O(N/sup 3/).<>

Published in:

Fault-Tolerant Computing, 1991. FTCS-21. Digest of Papers., Twenty-First International Symposium

Date of Conference:

25-27 June 1991