Preemptive rate-based operator scheduling in a Data Stream Management System

Sharaf, Mohamed A., Chrysanthis, Panos K. and Labrinidis, Alexandros (2005). Preemptive rate-based operator scheduling in a Data Stream Management System. In: Hesham EI-Rewini, ACS/IEEE International Conference on Computer Systems and Applications (3rd, 2005), Cairo, Egypt, (209-217). 3-6 January 2005. doi:10.1109/AICCSA.2005.1387043


Author Sharaf, Mohamed A.
Chrysanthis, Panos K.
Labrinidis, Alexandros
Title of paper Preemptive rate-based operator scheduling in a Data Stream Management System
Conference name ACS/IEEE International Conference on Computer Systems and Applications (3rd, 2005)
Conference location Cairo, Egypt
Conference dates 3-6 January 2005
Place of Publication Piscataway, NJ, U.S.A.
Publisher Arab Computer Society; IEEE Computer Society
Publication Year 2005
Sub-type Fully published paper
DOI 10.1109/AICCSA.2005.1387043
ISBN 9780780387355
078038735X
Editor Hesham EI-Rewini
Start page 209
End page 217
Total pages 9
Language eng
Formatted Abstract/Summary
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.
Q-Index Code E1
Q-Index Status Provisional Code
Institutional Status Non-UQ
Additional Notes Article number 1387043

 
Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 19 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Sun, 23 Oct 2011, 13:32:58 EST by Dr Mohamed Sharaf on behalf of School of Information Technol and Elec Engineering