TY - GEN
T1 - Preemptive rate-based operator scheduling in a Data Stream Management System
AU - Sharaf, Mohamed A.
AU - Chrysanthis, Panos K.
AU - Labrinidis, Alexandras
PY - 2005
Y1 - 2005
N2 - Data Stream Management Systems are being developed to process continuous queries over multiple data streams. These continuous queries are typically used for monitoring purposes where the detection of an event might trigger a sequence of actions or the execution of a set of specified tasks. Such events are identified by tuples produced by a query and hence, it is important to produce the available portions of a query result as early as possible. A core element for improving the interactive performance of a continuous query is the operator scheduler. An operator scheduler is particularly important when the processing requirements and the productivity of different streams are highly skewed. The need for an operator scheduler becomes even more crucial when tuples from different streams arrive asynchronously. To meet these needs, we are proposing a Preemptive Rate-based scheduling policy that handles the asynchronous nature of tuple arrival and the heterogeneity in the query plan. Experimental results show the significant improvements provided by our proposed policy.
AB - Data Stream Management Systems are being developed to process continuous queries over multiple data streams. These continuous queries are typically used for monitoring purposes where the detection of an event might trigger a sequence of actions or the execution of a set of specified tasks. Such events are identified by tuples produced by a query and hence, it is important to produce the available portions of a query result as early as possible. A core element for improving the interactive performance of a continuous query is the operator scheduler. An operator scheduler is particularly important when the processing requirements and the productivity of different streams are highly skewed. The need for an operator scheduler becomes even more crucial when tuples from different streams arrive asynchronously. To meet these needs, we are proposing a Preemptive Rate-based scheduling policy that handles the asynchronous nature of tuple arrival and the heterogeneity in the query plan. Experimental results show the significant improvements provided by our proposed policy.
UR - http://www.scopus.com/inward/record.url?scp=33746576885&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746576885&partnerID=8YFLogxK
U2 - 10.1109/AICCSA.2005.1387043
DO - 10.1109/AICCSA.2005.1387043
M3 - Conference contribution
AN - SCOPUS:33746576885
SN - 078038735X
SN - 9780780387355
T3 - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
SP - 46
EP - 54
BT - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
PB - IEEE Computer Society
T2 - 3rd ACS/IEEE International Conference on Computer Systems and Applications, 2005
Y2 - 3 January 2005 through 6 January 2005
ER -