Scheduling and dropping algorithms to support integrated services in packet-switched networks
Scheduling and dropping algorithms to support integrated services in packet-switched networks
Real-time transaction scheduling: a cost conscious approach
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Scheduling and admission control for integrated-services networks: the Priority Token Bank
Computer Networks: The International Journal of Computer and Telecommunications Networking
Integrating user-perceived quality into Web server design
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
On maximizing service-level-agreement profits
Proceedings of the 3rd ACM conference on Electronic Commerce
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Value-based scheduling in real-time database systems
The VLDB Journal — The International Journal on Very Large Data Bases
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A method for transparent admission control and request scheduling in e-commerce web sites
Proceedings of the 13th international conference on World Wide Web
Real-Time Databases and Data Services
Real-Time Systems
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
SLA based profit optimization in autonomic computing systems
Proceedings of the 2nd international conference on Service oriented computing
Profitable services in an uncertain world
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Open versus closed: a cautionary tale
NSDI'06 Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Adaptive quality of service management for enterprise services
ACM Transactions on the Web (TWEB)
Architecture of a Database System
Foundations and Trends in Databases
Fair, effective, efficient and differentiated scheduling in an enterprise data warehouse
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Scheduling Algorithms
Adaptive Scheduling of Web Transactions
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Predicting Multiple Metrics for Queries: Better Decisions Enabled by Machine Learning
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
Communications of the ACM
NP-complete scheduling problems
Journal of Computer and System Sciences
Performance prediction for concurrent database workloads
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
iCBS: incremental cost-based scheduling under piecewise linear SLAs
Proceedings of the VLDB Endowment
ActiveSLA: a profit-oriented admission control framework for database-as-a-service providers
Proceedings of the 2nd ACM Symposium on Cloud Computing
A workload characterization study of the 1998 World Cup Web site
IEEE Network: The Magazine of Global Internetworking
Robust estimation of resource consumption for SQL queries using statistical techniques
Proceedings of the VLDB Endowment
Zeta: scheduling interactive services with partial execution
Proceedings of the Third ACM Symposium on Cloud Computing
| Hi-index | 0.00 |
Query scheduling, a fundamental problem in database management systems, has recently received a renewed attention, perhaps in part due to the rise of the "database as a service" (DaaS) model for database deployment. While there has been a great deal of work investigating different scheduling algorithms, there has been comparatively little work investigating what the scheduling algorithms can or should know about the queries to be scheduled. In this work, we investigate the efficacy of using histograms describing the distribution of likely query execution times as input to the query scheduler. We propose a novel distribution-based scheduling algorithm, Shepherd, and show that Shepherd substantially outperforms state-of-the-art point-based methods through extensive experimentation with both synthetic and TPC workloads.