Analysis and Synthesis of Computer Systems

The following sections are included:

• Preface to the Second Edition

• Contents

The following sections are included:

• General background

• Markov processes. The exponential distribution

• Poisson arrival streams. Important properties

• Steady-state. Balance diagrams. The “Birth and Death” process

• The M/M/1, M/M/c and related queueing systems

• Little's result. Applications. The M/G/1 system

• Operational identities

• Priority queueing

• References

The following sections are included:

• Introduction

• The queue with server of walking type with Poisson arrivals, and the M/G/1 queue
  • The embedded Markov chain
  • The stationary queue length process

• Evaluation of secondary memory device performance
  • Application to a paging drum model
  • Solid-state secondary memory devices

• Analysis of multiplexed data communication systems
  • Best and worst case analysis for the buffer queues
  • Approximate analysis of buffer queue length

• References

The following sections are included:

• General remarks

• Feedforward networks and product-form solution

• Jackson networks

• Other scheduling strategies and service time distributions
  • The egalitarian processor-sharing strategy
  • The pre-emptive-resume LCFS strategy
  • The server-per-job strategy

• The BCMP theorem

• The computation of performance measures

• References

The following sections are included:

• Introduction

• The model
  • State representation

• Main results

• Existence of the solution to the traffic equations

• Conclusion

• References

The following sections are included:

• A multiserver queue with breakdowns and repairs

• Manufacturing blocking

• Phase-type distributions

• Checkpointing and recovery in the presence of faults

• Spectral expansion solution

• Balance equations

• Batch arrivals and/or departures

• A simple approximation

• The heavy traffic limit

• Applications and comparisons

• Remarks

• References

The following sections are included:

• Introduction

• Diffusion approximation for a single queue
  • Queues and the numerical discretisation of the diffusion equation
  • An approach based on the central limit theorem
  • The instantaneous return process [10, 11]
  • Application to the GI/G/1 queue: stationary solution
  • Application to a closed two-server system with general service time distributions
  • The discretisation problem

• Diffusion approximations for general networks of queues with one customer class
  • Application to packet-switching computer-communication networks
  • The approach of Kobayashi and Reiser to the approximation of queueing networks

• Approximate behaviour of a single queue in a network with multiple customer classes
  • Computation of the approximate interarrival statistics for each queue
  • Diffusion approximation to the queue length process

• Conclusion

• References

The following sections are included:

• Introduction

• Subsystem isolation
  • Aggregate/subsystem decomposition for a closed Jackson network
  • Solution with one single aggregate/subsystem decomposition

• Decomposition as an approximate solution method
  • Approximate stationary solution of the system Q

• An electric circuit analogy for queueing network solution

• References

The following sections are included:

• Problem formulation

• Conservation laws and inequalities

• Characterisation theorems

• The realisation of pre-specified performance vectors. Complete families of scheduling strategies
  • Generalised processor-sharing strategies

• Optimal scheduling strategies

• References

The following sections are included:

• Some problems arising in multiprogrammed computer systems

• The modelling of system resources and program behaviour

• Control of the degree of multiprogramming
  • The knee criterion
  • The L = S criterion
  • The 50% criterion

• The page fault rate control policy (RCP)

• Control of performance by selective memory allocation

• Towards a characterisation of achievable performance in terminal systems

• References

The following sections are included:

• Introduction
  • The mathematical model
  • Relation to previous work

• Properties of the waiting time process

• Application to a paging drum model

• References

The following sections are included:

• Index