Abstract
The increasing demand on streaming data processing has motivated the study of providing Quality of Service (QoS) for data stream processing. Especially for mission-critical applications, deterministic QoS requirements are always desired in order for the results to be useful. However, the best-effort QoS providing of most existing data stream systems would bring about considerable uncertainty to the query results. This paper attempts to provide a new insight into the problem of providing QoS guarantee for continuous queries over streams. Based on the proposed QoS model of stream processing, a QoS guaranteeing scheduling algorithm is proposed. Experimental results are presented to characterize the efficiency and effectiveness of our approaches.
Partially supported by National Science Foundation (60473073, 60503036), and Fok Ying Tung Education Foundation under No. 104027.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carney, D., Centintemel, U., et al.: Operator scheduling in a data stream manager. In: Proc. of the 29th VLDB Conf., Berlin, Germany, Sep. 2003, pp. 838–849 (2003)
Babcock, B., Babu, S., Datar, M., Motwani, R.: Chain: Operator Scheduling for Memory Minimization in Data Stream Systems. In: Proc. of the ACM SIGMOD 2003, San Diego, California, USA, June 2003, pp. 253–264 (2003)
Avnur, R., Hellerstein, J.M.: Eddies: Continuously Adaptive Query Processing. In: Proc. of the ACM SIGMOD 2000, Dallas, TX, May 2000, pp. 261–272 (2000)
Cruz, R.L.: Quality of service guarantees in virtual circuit switched networks. IEEE J. Select. Areas Commun. 13, 1048–1056 (1995)
Le Boudec, J.-Y., Thiran, P.: Network Calculus. In: Thiran, P., Le Boudec, J.-Y. (eds.) Network Calculus. LNCS, vol. 2050, p. 3. Springer, Heidelberg (2001)
Sariowan, H., Cruz, R.L., Polyzos, G.C.: SCED: A generalized scheduling policy for guaranteeing quality-of-service. IEEE/ACM Trans. On Networking 7(5), 669–684 (1999)
Pyun, K., Song, J., Lee, H.K.: Two service curve allocation schemes for achieving both high network utilization and a constant deadline computation in a service curve algorithm. Technical report CS/TR-2003-190 of KAIST Department of Computer Science (April 2003)
Liu, C.L., Layland, J.W.: Scheduling algorithms for multi-programming in a hard real-time environment. Journal of the Association for Computing Machinery 20(1), 40–61 (1973)
Jiang, Q., Chakravarthy, S.: Scheduling Strategies for Processing Continuous Queries over Streams. In: Williams, H., MacKinnon, L.M. (eds.) BNCOD 2004. LNCS, vol. 3112, pp. 16–30. Springer, Heidelberg (2004)
Sharaf, A.M., Chrysanthis, K.P., Labrinidis, A.: Preemptive Rate-based Operator Scheduling in a Data Stream Management System. In: Proc. of the Third ACS/IEEE International Conference on Computer Systems and Applications (AICCSA), Cairo, Egypt, January 2005, pp. 46–54 (2005)
Schmidt, S., Legler, T., Schaller, D., Lehner, W.: Real-Time Scheduling for Data Stream Management Systems. In: Proc. of the 17th Euromicro Conference on Real-Time Systems (ECRTS’05), Palma de Mallorca, Spain, July 2005, pp. 167–176 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Wu, S., Lv, Y., Yu, G., Gu, Y., Li, X. (2007). A QoS-Guaranteeing Scheduling Algorithm for Continuous Queries over Streams. In: Dong, G., Lin, X., Wang, W., Yang, Y., Yu, J.X. (eds) Advances in Data and Web Management. APWeb WAIM 2007 2007. Lecture Notes in Computer Science, vol 4505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72524-4_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-72524-4_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72483-4
Online ISBN: 978-3-540-72524-4
eBook Packages: Computer ScienceComputer Science (R0)