The golden mean operator scheduling strategy in data stream systems

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A scheduling strategy, called Golden Mean (GM), is designed to achieve the dynamic balance between the memory usage minimization and latency minimization by taking the status of the future workload, the current memory consumption and QoS requirement of the query into account. In the GM scheduling strategy, the executing order of the operators is decided uniformly according to the Scoring Function. The static parameters in the Scoring Function can be customized to meet the need of various application scenarios, while the dynamical parameters can be adjusted automatically according to the current system status. In addition, the priority levels of queries can be guaranteed by GM. The experimental results indicate that the GM scheduling strategy is very effective in practice. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Deng, H., Liu, Y., & Xiao, Y. (2007). The golden mean operator scheduling strategy in data stream systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4537 LNCS, pp. 186–191). Springer Verlag. https://doi.org/10.1007/978-3-540-72909-9_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free