Tick scheduling: a deadline based optimal task scheduling approach for real-time data stream systems

Authors:
Zhengyu Ou;Ge Yu;Yaxin Yu;Shanshan Wu;Xiaochun Yang;Qingxu Deng
Affiliations:
Dept. of Computer Science and Engineering, Northeastern University, P.R. China;Dept. of Computer Science and Engineering, Northeastern University, P.R. China;Dept. of Computer Science and Engineering, Northeastern University, P.R. China;Dept. of Computer Science and Engineering, Northeastern University, P.R. China;Dept. of Computer Science and Engineering, Northeastern University, P.R. China;Dept. of Computer Science and Engineering, Northeastern University, P.R. China
Venue:
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Year:
2005

Citing 7
Cited 0

Real-time software design and analysis of reconfigurable multi-sensor based systems

Real-time software design and analysis of reconfigurable multi-sensor based systems
Borrowed-virtual-time (BVT) scheduling: supporting latency-sensitive threads in a general-purpose scheduler

Proceedings of the seventeenth ACM symposium on Operating systems principles
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Eddies: continuously adaptive query processing

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Chain: operator scheduling for memory minimization in data stream systems

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
PSoup: a system for streaming queries over streaming data

The VLDB Journal — The International Journal on Very Large Data Bases
Operator scheduling in a data stream manager

VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the current research work on timely streaming data processing focuses on minimizing average tuple latency instead of strict individual tuple latency upper-bound, that is, deadline. In this paper, we propose a novel deadline-scheduling strategy, namely tick scheduling (TS), dealing with applications with specified deadline constraints over high volume, possibly bursting, and continuous data streams. We demonstrate that TS policy, which combines precise batch scheduling plan construction and adaptive batch maintenance mechanism can significantly improve system performance by greatly reducing system overheads and adapting gracefully to the time-varying data arrival-rate. Experimental results show the significant improvements provided by our proposed policy.