Scheduling with queue length guarantees for shared resource systems

Authors:
Gagan R. Gupta;Ness B. Shroff
Affiliations:
Purdue University, West Lafayette, IN, USA;The Ohio State University, Columbus, OH, USA
Venue:
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Year:
2008

Citing 1
Cited 1

Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking

Workload optimality in switches without arrivals

ACM SIGMETRICS Performance Evaluation Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a class of schemes called GMWM that guarantee optimal throughput for queuing systems with arbitrary constraints on the set of jobs that can be served simultaneously. We obtain an analytical upper bound on the expected queue length. To further tighten the upper bound, we formulate it as a convex optimization problem. We also show that whenever the arrival process is stabilizable, the scheme is guaranteed to achieve an expected queue length that is no larger than the expected queue length of any stationary randomized policy.