Analysis and Synthesis of Computer Systems

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

ISBN: 9781848163959 | 1848163959
Cover: Hardcover
Copyright: 4/14/2010

eBook

Available Instantly

Online: 1825 Days

Downloadable: Lifetime Access

*To support the delivery of the digital material to you, a digital delivery fee of $3.99 will be charged on each digital item.

$216.00*

Analysis and Synthesis of Computer Systems presents a broad overview of methods that are used to evaluate the performance of computer systems and networks, manufacturing systems, and interconnected services systems. Aside from a highly readable style that rigorously addresses all subjects, this second edition includes new chapters on numerical methods for queueing models and on G-networks, the latter being a new area of queuing theory that one of the authors has pioneered. This book will have a broad appeal to students, practitioners and researchers in several different areas, including practicing computer engineers as well as computer science and engineering students.

Preface to the Second Edition	p. v
Basic Tools of Probabilistic Modelling	p. 1
General background	p. 1
Markov processes. The exponential distribution	p. 3
Poisson arrival streams. Important properties	p. 9
Steady-state. Balance diagrams. The "Birth and Death" process	p. 13
The M/M/1, M/M/c and related queueing systems	p. 20
Little's result. Applications. The M/G/1 system	p. 28
Operational identities	p. 34
Priority queueing	p. 37
References	p. 42
The Queue with Server of Walking Type and Its Applications to Computer System Modelling	p. 43
Introduction	p. 43
The queue with server of walking type with Poisson arrivals, and the M/G/1 queue	p. 44
Evaluation of secondary memory device performance	p. 58
Analysis of multiplexed data communication systems	p. 68
References	p. 71
Queueing Network Models	p. 73
General remarks	p. 73
Feedforward networks and product-form solution	p. 76
Jackson networks	p. 80
Other scheduling strategies and service time distributions	p. 90
The BCMP theorem	p. 98
The computation of performance measures	p. 106
References	p. 114
Queueing Networks with Multiple Classes of Positive and Negative Customers and Product Form Solution	p. 117
Introduction	p. 117
The model	p. 119
Main results	p. 121
Existence of the solution to the traffic equations	p. 132
Conclusion	p. 134
References	p. 134
Markov-Modulated Queues	p. 137
A multiserver queue with breakdowns and repairs	p. 139
Manufacturing blocking	p. 141
Phase-type distributions	p. 142
Checkpointing and recovery in the presence of faults	p. 143
Spectral expansion solution	p. 144
Balance equations	p. 146
Batch arrivals and/or departures	p. 151
A simple approximation	p. 153
The heavy traffic limit	p. 155
Applications and comparisons	p. 158
Remarks	p. 163
References	p. 164
Diffusion Approximation Methods for General Queueing Networks	p. 165
Introduction	p. 165
Diffusion approximation for a single queue	p. 166
Diffusion approximations for general networks of queues with one customer class	p. 185
Approximate behaviour of a single queue in a network with multiple customer classes	p. 201
Conclusion	p. 206
References	p. 207
Approximate Decomposition and Iterative Techniques for Closed Model Solution	p. 211
Introduction	p. 211
Subsystem isolation	p. 211
Decomposition as an approximate solution method	p. 215
An electric circuit analogy for queueing network solution	p. 224
References	p. 229
Synthesis Problems in Single-Resource Systems: Characterisation and Control of Achievable Performance	p. 231
Problem formulation	p. 231
Conservation laws and inequalities	p. 233
Characterisation theorems	p. 242
The realisation of pre-specified performance vectors. Complete families of scheduling strategies	p. 249
Optimal scheduling strategies	p. 259
References	p. 268
Control of Performance in Multiple-Resource Systems	p. 269
Some problems arising in multiprogrammed computer systems	p. 269
The modelling of system resources and program behaviour	p. 271
Control of the degree of multiprogramming	p. 274
The page fault rate control policy (RCP)	p. 281
Control of performance by selective memory allocation	p. 287
Towards a characterisation of achievable performance in terminal systems	p. 292
References	p. 294
A Queue with Server of Walking Type	p. 297
Introduction	p. 297
Properties of the waiting time process	p. 299
Application to a paging drum model	p. 307
References	p. 307
Index	p. 309
Table of Contents provided by Ingram. All Rights Reserved.

Please wait while the item is added to your bag...

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Analysis and Synthesis of Computer Systems

Summary

Table of Contents

Supplemental Materials

FREE SHIPPING

Rent More, Save More! Use code: BBRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

Analysis and Synthesis of Computer Systems

Summary

Table of Contents

Supplemental Materials

Digital License