Weighted fair sharing for dynamic virtual clusters

Published

Journal Article

In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support wide (parallel) requests for variable-sized pool of resources, provide assurance of minimum resource allotment on demand, and give predictable assignments. Our approach integrates a fair queuing algorithm with a calendar scheduler. We present WlNKS, a proportional share allocation policy that addresses the needs of shared server environments. It extends start-time fair queuing to support wide requests with backfill, advance reservations, dynamic cluster sizing, dynamic request sizing, and intra-flow request prioritization. It also preserves fairness properties across queue transformations and calendar operations needed to implement these extensions.

Full Text

Duke Authors

Cited Authors

  • Grit, LE; Chase, JS

Published Date

  • December 12, 2008

Published In

  • Sigmetrics'08: Proceedings of the 2008 Acm Sigmetrics International Conference on Measurement and Modeling of Computer Systems

Volume / Issue

  • 36 / 1 SPECIAL ISSUE

Start / End Page

  • 461 - 462

Digital Object Identifier (DOI)

  • 10.1145/1375457.1375521

Citation Source

  • Scopus