Skip to main content
Journal cover image

Controllable fair queuing for meeting performance goals

Publication ,  Journal Article
Karlsson, M; Karamanolis, C; Chase, J
Published in: Performance Evaluation
October 1, 2005

Computing and storage utilities must control resource usage to meet contractual performance targets for hosted customers under dynamic conditions, including flash crowds and unexpected resource failures. This paper explores properties of proportional share resource schedulers that are necessary for stability and responsiveness under feedback control. It shows that the fairness properties commonly defined for proportional share schedulers using Weighted Fair Queuing (WFQ) are not preserved across changes to the relative weights of competing request flows. As a result, conventional WFQ schedulers are not controllable by a resource controller that adapts by adjusting the weights. The paper defines controllable fairness properties, presents an algorithm to adjust any WFQ scheduler when the weights change, and proves that the algorithm results in controllable-fair schedulers. The analytic results are confirmed by experimental evaluation using a three-tier Web service and a prototype controllable-fair scheduler called C-SFQ(D). C-SFQ(D) extends concurrency-controlled Start-time Fair Queuing (SFQ(D), which supports proportional sharing in multi-tasking computing resources. The prototype includes an adaptive control system that adjusts the flow weights in C-SFQ(D) to meet latency and throughput targets under a variety of conditions. The experimental results demonstrate the importance of controllable-fair scheduling for feedback control of computing utilities. © 2005 Elsevier B.V. All rights reserved.

Duke Scholars

Published In

Performance Evaluation

DOI

ISSN

0166-5316

Publication Date

October 1, 2005

Volume

62

Issue

1-4

Start / End Page

278 / 294

Related Subject Headings

  • Networking & Telecommunications
  • 49 Mathematical sciences
  • 46 Information and computing sciences
  • 10 Technology
  • 08 Information and Computing Sciences
  • 01 Mathematical Sciences
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Karlsson, M., Karamanolis, C., & Chase, J. (2005). Controllable fair queuing for meeting performance goals. Performance Evaluation, 62(1–4), 278–294. https://doi.org/10.1016/j.peva.2005.07.019
Karlsson, M., C. Karamanolis, and J. Chase. “Controllable fair queuing for meeting performance goals.” Performance Evaluation 62, no. 1–4 (October 1, 2005): 278–94. https://doi.org/10.1016/j.peva.2005.07.019.
Karlsson M, Karamanolis C, Chase J. Controllable fair queuing for meeting performance goals. Performance Evaluation. 2005 Oct 1;62(1–4):278–94.
Karlsson, M., et al. “Controllable fair queuing for meeting performance goals.” Performance Evaluation, vol. 62, no. 1–4, Oct. 2005, pp. 278–94. Scopus, doi:10.1016/j.peva.2005.07.019.
Karlsson M, Karamanolis C, Chase J. Controllable fair queuing for meeting performance goals. Performance Evaluation. 2005 Oct 1;62(1–4):278–294.
Journal cover image

Published In

Performance Evaluation

DOI

ISSN

0166-5316

Publication Date

October 1, 2005

Volume

62

Issue

1-4

Start / End Page

278 / 294

Related Subject Headings

  • Networking & Telecommunications
  • 49 Mathematical sciences
  • 46 Information and computing sciences
  • 10 Technology
  • 08 Information and Computing Sciences
  • 01 Mathematical Sciences