.png){kind=icon}
.png){kind=icon}
Return
Cone Schedules for Processing Systems in Fluctuating Environments
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2015.2398881.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Availability
communication networks
processor scheduling
queueing analysis
reliability
throughput
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations