Efficient scheduling of heterogeneous continuous queries Export

@inproceedings{citeulike:4166865, abstract = {Data Stream Management Systems (DSMS) typically host multiple Continuous Queries (CQ) that process streams of data. In this paper, we examine the problem of how to schedule CQs in a DSMS to optimize for average QoS. We show that unlike standard on-line systems, scheduling policies in DSMSs that optimize for average response time will be different than policies that optimize for average slowdown which is more appropriate metric to use in the presence of a heterogeneous workload. We also propose a hybrid scheduling policy based on slowdown that strikes a fine balance between performance and fairness. We further discuss how our policies can be efficiently implemented and extended to exploit sharing in optimized multi-query plans and multi-stream CQs. Finally, we experimentally show using real data that our policies outperform currently used ones.}, author = {Sharaf, Mohamed A. and Chrysanthis, Panos K. and Labrinidis, Alexandros and Pruhs, Kirk}, booktitle = {VLDB '06: Proceedings of the 32nd international conference on Very large data bases}, citeulike-article-id = {4166865}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1164172}, keywords = {2006, dsms, vldb}, location = {Seoul, Korea}, pages = {511--522}, posted-at = {2009-03-12 01:00:59}, priority = {2}, publisher = {VLDB Endowment}, title = {Efficient scheduling of heterogeneous continuous queries}, url = {http://portal.acm.org/citation.cfm?id=1164172}, year = {2006} }

TY - CONF ID - citeulike:4166865 L3 - citeulike-article-id:4166865 N2 - Data Stream Management Systems (DSMS) typically host multiple Continuous Queries (CQ) that process streams of data. In this paper, we examine the problem of how to schedule CQs in a DSMS to optimize for average QoS. We show that unlike standard on-line systems, scheduling policies in DSMSs that optimize for average response time will be different than policies that optimize for average slowdown which is more appropriate metric to use in the presence of a heterogeneous workload. We also propose a hybrid scheduling policy based on slowdown that strikes a fine balance between performance and fairness. We further discuss how our policies can be efficiently implemented and extended to exploit sharing in optimized multi-query plans and multi-stream CQs. Finally, we experimentally show using real data that our policies outperform currently used ones. CY - Seoul, Korea EP - 522 TI - Efficient scheduling of heterogeneous continuous queries PB - VLDB Endowment T2 - VLDB '06: Proceedings of the 32nd international conference on Very large data bases SP - 511 KW - 2006 KW - dsms KW - vldb AU - Sharaf, Mohamed AU - Chrysanthis, Panos AU - Labrinidis, Alexandros AU - Pruhs, Kirk PY - 2006/// UR - http://portal.acm.org/citation.cfm?id=1164172 ER -