ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1016 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.peva.2007.06.028    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2007 Elsevier Ltd All rights reserved.

The Foreground–Background queue: A survey

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Misja Nuyensa, Corresponding Author Contact Information, E-mail The Corresponding Author, E-mail The Corresponding Author and Adam Wiermanb, 1, E-mail The Corresponding Author

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

Article Outline

1. Introduction
2. An introduction to FB
3. The history of FB
4. The optimality of FB
5. The mean performance of FB
5.1. The impact of variability
5.2. The impact of load
6. Beyond the mean performance of FB
6.1. The response-time distribution
6.2. The queue-length distribution
7. The performance of large jobs under FB
8. Future research topics
Acknowledgements
Appendix. Proof of Theorem 5.4
References
Vitae





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

 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.