Algorithms for Scheduling Imprecise Computations
Computer - Special issue on real-time systems
Estimating security price derivatives using simulation
Management Science
Criticality- and QoS-Based Multiresource Negotiation andAdaptation
Real-Time Systems
Web content adaptation to improve server overload behavior
WWW '99 Proceedings of the eighth international conference on World Wide Web
ACM SIGOPS Operating Systems Review
SEDA: an architecture for well-conditioned, scalable internet services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
On-Line Scheduling with Tight Deadlines
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Competitive Online Scheduling with Level of Service
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Detecting web page structure for adaptive viewing on small form factor devices
WWW '03 Proceedings of the 12th international conference on World Wide Web
Preemptive scheduling in overloaded systems
Journal of Computer and System Sciences
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
Adaptive overload control for busy internet servers
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Utility Accrual Real-Time Scheduling under Variable Cost Functions
IEEE Transactions on Computers
The valuation of multidimensional American real options using the LSM simulation method
Computers and Operations Research
Quantifying the cost of context switch
Proceedings of the 2007 workshop on Experimental computer science
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Efficient guaranteed disk request scheduling with fahrrad
Proceedings of the 3rd ACM SIGOPS/EuroSys European Conference on Computer Systems 2008
An Adaptive Framework for Multiprocessor Real-Time System
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Search Engines: Information Retrieval in Practice
Search Engines: Information Retrieval in Practice
Green: a framework for supporting energy-conscious programming using controlled approximation
PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Dynamic knobs for responsive power-aware computing
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
Tians Scheduling: Using Partial Processing in Best-Effort Applications
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
User-level QoS-adaptive resource management in server end-systems
IEEE Transactions on Computers
QoS-adaptive proxy caching for multimedia streaming over the Internet
IEEE Transactions on Circuits and Systems for Video Technology
Speeding up distributed request-response workflows
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Distribution-based query scheduling
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other interactive, on-line services. We develop an efficient scheduling algorithm, Zeta, that allocates processor time among service requests to maximize the quality and minimize the variance of the response. Zeta exploits the concavity of the request quality profile to distribute processing time among outstanding requests. By executing some requests partially (and obtaining much or most benefit of a full execution), Zeta frees resources for other requests, which might have timed out and produced no results. Compared to scheduling algorithms that consider only deadline or quality profile information, Zeta improves overall response quality and reduces response quality variance, yielding significant improvement in the high-percentile response quality. We implemented and deployed Zeta in the Microsoft Bing web search engine and evaluated its performance in a production environment with realistic workloads. Measurements show that at the same response quality and latency as the production system, Zeta increases system capacity by 29% by improving both average and high percentile response quality. We also implemented Zeta in a finance server that computes option prices. In this application, Zeta improves average response quality by 28% and the 99-percentile quality by 80%. Using a simulation, we also compared Zeta to the offline optimal schedule and other scheduling algorithms. Although Zeta is only close to optimal, it provides better performance than prior algorithms under a wide variety of operating conditions.