A Hierarchical Approximation Algorithm For Large Multichain Product Form Queueing Networks
Download A Hierarchical Approximation Algorithm For Large Multichain Product Form Queueing Networks full books in PDF, epub, and Kindle. Read online free A Hierarchical Approximation Algorithm For Large Multichain Product Form Queueing Networks ebook anywhere anytime directly on your device. Fast Download speed and no annoying ads. We cannot guarantee that every ebooks is available!
Author | : H. R. Bahadori |
Publisher | : |
Total Pages | : 51 |
Release | : 1987 |
Genre | : |
ISBN | : |
In recent years we have witnessed an increasing proliferation of local area network-based distributed systems. Very large distributed systems based on wide area networks are already in the design stages in numerous research organizations. In these systems, resources such as processing power, databases, and software are shared among users and jobs at different sites. Modeling and evaluating the performance of such large systems typically require the solution of queueing network models with large numbers of chains (classes), service centers, and populations. These large models preclude any use of exact solution techniques. Therefore, it is important that efficient and cost effective approximate algorithms for the solutions of large multichain queuing networks be devised to aid in the modeling, configuration, planning, performance, evaluation, and design of the systems these models represent. In this paper we propose a hierarchical approximation technique for multiclass separable queuing networks. This technique, which relies on network transformations, provides us with a smooth tradeoff between cost and accuracy. The key elements of the approach entail transforming queuing networks containing multiple infinite servers into ones containing a single infinite server model in the first step. In the next stage at least some of the closed chains are transformed into open chains, resulting in a mixed network; this is done on the basis of the desired error and computational cost. If necessary, a completely open network may be obtained. Furthermore, upper and lower bounds of the performance measures can be computed. These bounds are asymptotically correct. Numerical results are presented which compare this method with those yielding exact values and with other approximate algorithms.
Author | : Hamid Reza Bahadori |
Publisher | : |
Total Pages | : 384 |
Release | : 1988 |
Genre | : Algorithms |
ISBN | : |
Author | : Hamid Reza Bahadori |
Publisher | : |
Total Pages | : 117 |
Release | : 1988 |
Genre | : |
ISBN | : |
Author | : International Business Machines Corporation. Research Division |
Publisher | : |
Total Pages | : 31 |
Release | : 1980 |
Genre | : |
ISBN | : |
Author | : M.M. Srinivasan |
Publisher | : |
Total Pages | : 26 |
Release | : 1986 |
Genre | : |
ISBN | : |
Author | : R. E. Trahan |
Publisher | : ACTA Press |
Total Pages | : 174 |
Release | : 1987 |
Genre | : Computers |
ISBN | : |
Author | : Steven C. Bruell |
Publisher | : North-Holland |
Total Pages | : 214 |
Release | : 1980 |
Genre | : Mathematics |
ISBN | : |
Author | : C. M. Krishna |
Publisher | : John Wiley & Sons |
Total Pages | : 408 |
Release | : 1995-10-14 |
Genre | : Computers |
ISBN | : 9780818670947 |
As computers become more complex, the number and complexity of the tasks facing the computer architect have increased. Computer performance often depends in complex way on the design parameters and intuition that must be supplemented by performance studies to enhance design productivity. This book introduces computer architects to computer system performance models and shows how they are relatively simple, inexpensive to implement, and sufficiently accurate for most purposes. It discusses the development of performance models based on queuing theory and probability. The text also shows how they are used to provide quick approximate calculations to indicate basic performance tradeoffs and narrow the range of parameters to consider when determining system configurations. It illustrates how performance models can demonstrate how a memory system is to be configured, what the cache structure should be, and what incremental changes in cache size can have on the miss rate. A particularly deep knowledge of probability theory or any other mathematical field to understand the papers in this volume is not required.
Author | : Manfred Mittler |
Publisher | : |
Total Pages | : 14 |
Release | : 1995 |
Genre | : |
ISBN | : |
Author | : Günter Haring |
Publisher | : Springer |
Total Pages | : 523 |
Release | : 2003-06-29 |
Genre | : Computers |
ISBN | : 3540465065 |
This monograph-like state-of-the-art survey presents the history, the key ideas, the success stories, and future challenges of performance evaluation and demonstrates the impact of performance evaluation on a variety of different areas through case studies in a coherent and comprehensive way. Leading researchers in the field have contributed 19 cross-reviewed topical chapters competently covering the whole range of performance evaluation, from theoretical and methodological issues to applications in numerous other fields. Additionally, the book contains one contribution on the role of performance evaluation in industry and personal accounts of four pioneering researchers describing the genesis of breakthrough results. The book will become a valuable source of reference and indispensable reading for anybody active or interested in performance evaluation.