End-to-end internet packet dynamics
IEEE/ACM Transactions on Networking (TON)
Flow and stretch metrics for scheduling continuous job streams
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Algorithms for minimizing weighted flow time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation schemes for preemptive weighted flow time
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Scheduling Algorithms
Improved algorithms for stretch scheduling
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Fairness and efficiency in web server protocols
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Online Scheduling to Minimize Average Stretch
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
How to Determine a Good Multi-Programming Level for External Scheduling
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Minimizing the stretch when scheduling flows of biological requests
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient scheduling of heterogeneous continuous queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Connection scheduling in web servers
USITS'99 Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2
rFEED: A Mixed Workload Scheduler for Enterprise Data Warehouses
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
SLA-tree: a framework for efficiently supporting SLA-based decisions in cloud computing
Proceedings of the 14th International Conference on Extending Database Technology
iCBS: incremental cost-based scheduling under piecewise linear SLAs
Proceedings of the VLDB Endowment
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
Distribution-based query scheduling
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
A typical online Business Intelligence (BI) workload consists of a combination of short, less intensive queries, along with long, resource intensive queries. As such, the longest queries in a typical BI workload may take several orders of magnitude more time to execute, compared with the shortest queries in the workload. This makes it challenging to design a good Mixed Workload Scheduler (MWS). In this paper we first define the design criteria that make a 'good' MWS. We then use these criteria to design rFEED, a MWS that is fair, effective, efficient, and differentiated. We simulate real workloads and compare our rFEED MWS with models of the current best of breed commercial systems. We show that the rFEED MWS works extremely well.