doi:10.1016/j.peva.2007.06.028
Copyright © 2007 Elsevier Ltd All rights reserved.
The Foreground–Background queue: A survey
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Misja Nuyensa,
,
,
and Adam Wiermanb, 1, 
aDepartment of Mathematics, Vrije Universiteit Amsterdam, De Boelelaan 1081, 1081 HV Amsterdam, The Netherlands
bComputer Science Department, Carnegie Mellon University, 5000 Forbes Avenue Pittsburgh, PA, USA
Received 10 October 2006;
revised 22 June 2007;
accepted 25 June 2007.
Available online 7 July 2007.
Abstract
Computer systems researchers have begun to apply the Foreground–Background (FB) scheduling discipline to a variety of applications, and as a result, there has been a resurgence in theoretical research studying FB. In this paper, we bring together results from both of these research streams to provide a survey of state-of-the-art theoretical results characterizing the performance of FB. Our emphasis throughout is on the impact of these results on computer systems.
Keywords: Scheduling policies; FB; FBPS; LAS; LAST; SET; SEPT; M/G/1 queue
Fig. 1. The age process of three jobs in the FB queue, with service times X1,X2 and X3. Small circles indicate that the server switches, large circles denote departures.
Fig. 2. An illustration of the impact of service time variability on the mean response time of FB. The service distributions in this figure are Weibull with mean 1 and the load is 0.7. The bounds on FB are from Theorem 5.1.
(a) Deterministic job sizes.
(b) Exponential job sizes.
(c) Pareto job sizes, α=1.5.
Fig. 3. An illustration of the impact of the service distribution on the growth rate of
with load.
(a) EV(x)/x.
(b)
.
Fig. 4. An illustration of the behavior of
and
. In all cases the service distribution is exponential and the load is 0.9. The top row shows the behavior as a function of x while the bottom row shows the behavior as a function of F(x), i.e., the percentile of x.

Corresponding author.
1 Present address: Computer Science Department, California Institute of Technology, 1200 E. California Boulevard, MC 256-80, Pasadena, CA 91125, USA.