2009
DOI: 10.1115/1.802977.paper240
View full text
|
|
Share

Abstract: 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 …

expand abstract