@inproceedings{he2011tians,
author = {He, Yuxiong and Elnikety, Sameh and },
title = {Tians Scheduling: Using Partial Processing in Best-Effort Applications},
booktitle = {ICDCS},
year = {2011},
month = {January},
abstract = {To service requests with high quality, interactive services such as web search, on-demand video and online gaming keep average server utilization low. As servers become busy, queuing delays increase, and requests miss their deadlines, resulting in degraded quality of service with poor user experience and potential revenue loss. In this paper, we propose Tians scheduling, a group of scheduling algorithms for interactive services that can produce partial answers during overload. A Tians scheduler allocates processing time to each request based on system load with the objective of maximizing overall quality of responses.
We propose three Tians scheduling algorithms — offline, online clairvoyant and online nonclairvoyant. For interactive applications with concave quality profile, we prove that the offline algorithm is optimal. We show the effectiveness of the online algorithms by conducting a simulation study modeling important applications — a web search engine and video-on-demand (VOD) system. Simulation results show a significant improvement of Tians over traditional server models: average response quality improves and the variance of responses decreases.},
url = {http://approjects.co.za/?big=en-us/research/publication/tians-scheduling-using-partial-processing-in-best-effort-applications/},
edition = {ICDCS},
}