IEEE Transactions on Computers · 1988 · 267 citations · 25 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsFault-tolerant ComputingFault-tolerant SystemsAlgorithm AnalysisMarkov ChainsMarkov ProcessesMultiprocessor SystemsParallel Computing SystemsPerformance ModelingAnalytical ModelsFault Tolerance In MultiprocessorsMultiprocessor SchedulingParallel Computing PerformancePolynomial-time AlgorithmsProbabilistic Performance AssessmentScheduling In Multiprocessor SystemsSimulation-based Performance Modeling
The behavior of the multiprocessor system is described as a continuous Markov chain, and a reward rate (performance measure) is associated with each state. The distribution of performability is evaluated for analytical models of a multiprocessor system using a polynomial-time algorithm that obtains the distribution of performability for repairable, as well as nonrepairable, systems with heterogeneous components with a substantial speedup over earlier work. Numerical results indicate that distributions of cumulative performance measures over finite intervals reveal behavior of multiprocessor systems not indicates by either steady-state or expected values alone.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
25