作者: Dawei Sun , Guangyan Zhang , Chengwen Wu , Keqin Li , Weimin Zheng
DOI: 10.1016/J.JCSS.2016.10.010
关键词: Data stream clustering 、 Critical path method 、 Scheduling (computing) 、 Stream 、 Distributed computing 、 Data stream mining 、 Data stream 、 Fault tolerance 、 Graph (abstract data type) 、 Computer science
摘要: Abstract Big data stream computing systems should work continuously to process streams of on-line data. Therefore, fault tolerance is one the key metrics quality service in big computing. In this paper, we propose a tolerant framework with deadline guarantee for called FTDG. First, FTDG identifies critical path graph at given throughput, and quantifies system reliability graph. Second, allocates tasks by aware heuristic scheduling mechanism. Third, online optimizes task reallocating vertices on lower response time reduce fluctuations. Theoretical as well experimental results demonstrate that makes desirable trade-off between high low objectives environments.