Computational geometry: an introduction
Computational geometry: an introduction
Scheduling and dropping algorithms to support integrated services in packet-switched networks
Scheduling and dropping algorithms to support integrated services in packet-switched networks
Scheduling and admission control for integrated-services networks: the Priority Token Bank
Computer Networks: The International Journal of Computer and Telecommunications Networking
Value-based scheduling in real-time database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Balancing Risk and Reward in a Market-Based Task Service
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
Adaptive quality of service management for enterprise services
ACM Transactions on the Web (TWEB)
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
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
CloudDB: One Size Fits All Revived
SERVICES '10 Proceedings of the 2010 6th World Congress on Services
SLA-tree: a framework for efficiently supporting SLA-based decisions in cloud computing
Proceedings of the 14th International Conference on Extending Database Technology
ActiveSLA: a profit-oriented admission control framework for database-as-a-service providers
Proceedings of the 2nd ACM Symposium on Cloud Computing
Data management research at NEC labs
ACM SIGMOD Record
Performance evaluation of scheduling algorithms for database services with soft and hard SLAs
Proceedings of the second international workshop on Data intensive computing in the clouds
PMAX: tenant placement in multitenant databases for profit maximization
Proceedings of the 16th International Conference on Extending Database Technology
Distribution-based query scheduling
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In a cloud computing environment, it is beneficial for the cloud service provider to offer differentiated services among different customers, who often have different cost profiles. Therefore, cost-aware scheduling of queries is important. A practical cost-aware scheduling algorithm must be able to handle the highly demanding query volumes in the scheduling queues to make online scheduling decisions very quickly. We develop such a highly efficient cost-aware query scheduling algorithm, called iCBS. iCBS takes the query costs derived from the service level agreements (SLAs) between the service provider and its customers into account to make cost-aware scheduling decisions. iCBS is an incremental variation of an existing scheduling algorithm, CBS. Although CBS exhibits an exceptionally good cost performance, it has a prohibitive time complexity. Our main contributions are (1) to observe how CBS behaves under piecewise linear SLAs, which are very common in cloud computing systems, and (2) to efficiently leverage these observations and to reduce the online time complexity from O(N) for the original version CBS to O(log2 N) for iCBS.