Paper Info
Title
Cone Schedules for Processing Systems in Fluctuating Environments
Abstract
Consider a generalized processing system with several queues, where the available service rate combinations are fluctuating over time due to reliability and availability variations, and the scheduler must respond dynamically to the workload and service availability. We establish that cone schedules, which leverage the geometry of the queueing dynamics, maximize the system throughput for a broad class of processing systems, even under adversarial arrival processes.
Year
DOI
Venue
2011
10.1109/TAC.2015.2398881
Automatic Control, IEEE Transactions  
Keywords
DocType
Volume
Vectors,Schedules,Availability,Load modeling,Stability analysis,Queueing analysis,Dynamic scheduling
Journal
PP
Issue
ISSN
Citations 
99
0018-9286
0
PageRank 
References 
Authors
0.34
13
3
Name
Order
Citations
PageRank
Kevin Ross1889.34
Nicholas Bambos2888145.45
George Michailidis330335.19