Abstract
Bounding techniques for queueing network models used to
analyze the performance of parallel and distributed computer systems accept single values as model inputs.
Uncertainties or variabilities in service demands may exist in many types of systems. Using models with a single aggregate mean value for each parameter for such systems can lead to inaccurate or even incorrect results. This paper proposes to use histograms for characterizing model parameters that are associated with uncertainty and/or variability. The adaptation of the well-known asymptotic bounds as well as balanced job bounds for single class queueing networks to histogram parameters is presented in the paper.
| Original language | English |
|---|---|
| Pages (from-to) | 1789-1806 |
| Number of pages | 18 |
| Journal | Parallel Computing |
| Volume | 22 |
| Issue number | 13 |
| DOIs | |
| Publication status | Published - 28 Feb 1997 |
Fields of science
- 102 Computer Sciences
- 102002 Augmented reality
- 102006 Computer supported cooperative work (CSCW)
- 102013 Human-computer interaction
- 102015 Information systems
- 102021 Pervasive computing
- 102025 Distributed systems
- 102027 Web engineering
- 202038 Telecommunications