Exploiting Application Semantics in Monitoring Real-Time Data Streams
Real-time stream processing applications must be prepared to operate under overloaded conditions. Existing load shedding techniques are not suitable for processing real-time data streams because their tuple dropping policies may violate application deadlines in an uncontrolled way. We’d argue that a more precise load shedding model, e.g., the (m, k) deadline model adopted in this paper, is much appropriate than the commonly used random dropping policy. Based on the (m, k) load shedding model and a novel load shedding approach, we propose a concrete (m, k) scheduling algorithm called SOSA-DBP by exploiting application semantics. Experimental results show that SOSA-DBP has significant performance gain over the existing (m, k) scheduling algorithm.
Hongya Wang LihChyun Shu Zhidong Qin Xiaoqiang Liu Jing Cong Hui Song
Donghua University School of Computer Science and Technology P.R.China National Cheng Kung University College of Management Taiwan,ROC
国际会议
The Ninth International Conference on Web-Age Information Management(第九届web时代信息管理国际会议)(WAIM 2008)
张家界
英文
2008-07-20(万方平台首次上网日期,不代表论文的发表时间)