Feedback Control of Computing Systems

Chapter 2 - Model Construction

The systematic design of feedback systems requires an ability to quantify the
effect of control inputs (e.g., buffer size) on measured outputs (e.g., response
times), both of which may vary with time. Indeed, developing such models is
at the heart of applying control theory in practice. The approach employed
throughout this book is to start simple. This does not mean that the target system
is simple! Rather, if simple models suffice, there is no need to develop complex
models.

Our starting point is queueing theory, a widely used conceptual framework
in which computing systems are viewed as networks of queues and servers.
Over the last 30 years, queueing theory has proven quite effective at modeling
the steady-state behavior of computing systems. Unfortunately, queueing models
become complicated if dynamics are considered. In this chapter we introduce
linear difference equations to model the dynamics of computing systems and
employ insights from queueing theory to construct such models. We discuss
briefly how difference equations can be constructed from first principles. Our
focus, however, is to construct models using statistical or black-box methods, a
process that is referred to as system identification.


2.1   BASICS OF QUEUEING THEORY


A queueing system consists of one or more buffers (queues) in which work
requests wait for one or more servers. Figure 1.7 displays a queueing system
with a single queue and a single server. This system operates as follows:

  • When a request arrives, it is placed in the queue.
  • When the server completes a request, another request is selected from the
    queue.
  • If the queue is empty, the server remains idle until the next request arrives.

Consider a queueing system in which requests are selected in a first-come, first-
served manner from the queue. Figure 2.1 depicts the dynamics of this system.
The horizontal line is time, which is numbered 0 through 9. The vertical axis
indicates the state of a request. The states are:

  • Arrived: has arrived and is waiting in the queue
  • Serving: is in service
  • Departed: has departed the system

We see that request 21 arrives at time 0 and immediately goes into service
since the system is empty upon its arrival. This request begins a busy period, a
time interval during which the server is busy. When request 22 arrives at time 1,
it must wait until time 2 to enter service since that is when request 21 completes
its service and departs. The busy period extends until time 7, when request 24
departs. Then the server enters an idle period until the next request arrives at
time 9.

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Order Picking Systems
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.