scientific article; zbMATH DE number 1336727
A multiprocessor computer system having \(N\) different processors with a common memory connected by a single bus is considered. The time intervals from the completion of the previous bus usage to the generation of a new request as well as the holding times of the common bus are exponentially distributed random variables with parameter depending on the state of the random environment. All random variables and the random environment are considered to be independent. The processors and the shared bus operating in a random environment are governed by an ergodic Markov chain. It is shown under some assumption that the busy period length of the bus converges weakly, under appropriate normalization, to an exponentially distributed random variable. This result applies for the approximate determination of main steady-state performance measures, such as system throughput, mean delay time, expected waiting time and mean number of active processor. The author presents a number of validation experiments examining the credibility of the proposed approximation against exact results for the performance measure of processor utilization at equilibrium. For the entire collection see [Zbl 0896.00028].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4258807)
