Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
International Conference on Advanced Computer Theory and Engineering (ICACTE 2009)
By
Xie Yi
Xie Yi
Search for other works by this author on:
ISBN:
9780791802977
No. of Pages:
2012
Publisher:
ASME Press
Publication date:
2009

Different scheduling strategies are extensively examined in this paper to compare their performance under a variety of data stream scenarios. These strategies include the Chain, Dynamic Chain and FIFO algorithms. The performance is judged in terms of Quality of Service (QoS) requirements such as tuple latency, memory requirements and system throughput. Scenarios of synthetic and real data streams are considered. The simulation results indicate that no specific algorithm can satisfy all QoS requirements in all scenarios of data streams. Therefore, an Intelligent policy should be adopted in a DSMS to switch between these algorithms according to the critical performance criterion and stream scenarios.

Abstract
Key Words
1. Introduction
2. Basic Process Model
3. Operator Scheduling Algorithms
4. Simulation Framework
5. Results and Discussion
6. Conclusions
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal