Name
Title | ||
|---|---|---|
Product-form solution techniques for the performance analysis of multiple-bus multiprocessor systems with nonuniform memory references |
Abstract | ||
|---|---|---|
Recursive relations are derived for the exact computation of the steady-state probability distribution of some queuing models with passive resources that can be used to analyze the performance of multiple-bus multiprocessor system architectures. The most general case that can be shown to admit a product-form solution is described, and a recursive solution is obtained taking into account, considering different processor access rates, different memory selection probabilities, and a first-come-first-served bus scheduling policy. Several simpler cases allowing easier model solutions are also considered. Numerical evaluations for large computing systems with nonuniform memory references show the usefulness of the results. |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/12.4604 | Computers, IEEE Transactions |
Keywords | Field | DocType |
multiprocessor interconnection networks,numerical analysis,performance evaluation,queueing theory,scheduling,exact computation,first-come-first-served bus scheduling policy,local balance property,memory selection probabilities,multiple-bus multiprocessor systems,nonuniform memory references,performance analysis,processor access rates,product-form solution,queuing models with passive resources,recursive solution,steady-state probability distribution | Product-form solution,Computer science,Scheduling (computing),Parallel computing,Multiprocessing,Real-time computing,Probability distribution,Queueing theory,Recursion,Computation,Mathematical logic | Journal |
Volume | Issue | ISSN |
37 | 5 | 0018-9340 |
Citations | PageRank | References |
11 | 0.99 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giovanni Chiola | 1 | 682 | 96.53 |
| Marco Ajmone Marsan | 2 | 987 | 78.15 |
| Gianfranco Balbo | 3 | 1807 | 243.48 |