Modelling of heterogeneous multiprocessor systems with randomly changing parameters
A queueing theoretic approach is developed to analyse the performance of heterogeneous multiprocessor computer systems evolving in random -environments. 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...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Published: |
1991
|
| Series: | Acta cybernetica
10 No. 1-2 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Subjects: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12495 |
| Summary: | A queueing theoretic approach is developed to analyse the performance of heterogeneous multiprocessor computer systems evolving in random -environments. 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 assumed to be exponentially distributed random variables with parameter depending on the state of the corresponding random environment. Each processor is characterised by its own acces and service rate. The bus arbiter selects the processor to use the common bus according to a FirstCome, First-Served (FCFS) discipline. Supposing that the acces rates of the processors are much greater than the corresponding service rates ("fast" arrival), it is shown that the busy period length of the bus converges weakly, under appropriate norming, to an exponentially distributed random variable. As a consequence the main steady-state performance measures, such as utilizations, throughput, mean delay time, expected waiting time, the average number of requests served during a busy period, and mean number of active processors can be calculated. Moreover, exact and approximate validation results are presented to illustrate the credibility of the proposed method. |
|---|---|
| Physical Description: | 71-84 |
| ISSN: | 0324-721X |