• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

The Foreground-Background queue: a survey. Performance Evaluation 65 (2008)

by M Nuyens, A Wierman
Add To MetaCart

Tools

Sorted by:
Results 1 - 7 of 7

Fairness and Classifications

by Adam Wierman
"... The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs bei ..."
Abstract - Cited by 10 (7 self) - Add to MetaCart
The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs being treated “unfairly.” However, fairness is an amorphous concept and thus difficult to define and study. This article provides a short survey of recent work in this area.

Queueing Disciplines

by Mor Harchol-Balter - WILEY ENCYCLOPEDIA OF OPERATIONS RESEARCH AND MANAGEMENT SCIENCE
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Many flows asymptotics for SMART scheduling policies

by Changwoo Yang, Adam Wierman, Sanjay Shakkottai, Mor Harchol-Balter , 2006
"... ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract not found

Monotonicity

by Misja Nuyens, Wemke Van Der Weij
"... in the limited processor sharing queue ..."
Abstract - Add to MetaCart
in the limited processor sharing queue

Is tail-optimal scheduling possible?

by Adam Wierman, Bert Zwart
"... ..."
Abstract - Add to MetaCart
Abstract not found

Fairness and Scheduling in Single Server Queues

by Adam Wierman
"... Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness ’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficu ..."
Abstract - Add to MetaCart
Traditionally, the study of scheduling policies has focused on performance metrics such as response time, queue length, and throughput. However, the more vague notion of ‘fairness ’ is often equally or more important than these traditional performance metrics. But, the concept of fairness is difficult to define and so it has been studied only sporadically. This has changed over the last decade and a growing literature providing an analytic framework for studying fairness has emerged. This article surveys recent developments, which include a rich variety of fairness metrics as well as a growing understanding of the fairness of common scheduling policies. Keywords: Queueing theory, Scheduling theory, Fairness

Recent sojourn time results for Multilevel

by Samuli Aalto, Urtzi Ayesta
"... special issue 10 year EURANDOM ..."
Abstract - Add to MetaCart
special issue 10 year EURANDOM
The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University