点击次数：

论文类型：期刊论文

发表时间：2012-01-01

发表刊物：JOURNAL OF SUPERCOMPUTING

收录刊物：Scopus、SCIE、EI

卷号：59

期号：1

页面范围：227-245

ISSN号：0920-8542

关键字：Multiprocessors; Sporadic tasks; Partitioned scheduling

摘要：The DBF* algorithm of sporadic task systems on multiprocessors uses the approximation of the exact demand bound function on uniprocessor as a criterion. The systems which are feasible under the partitioned paradigm are flagged as "infeasible" sometimes. In this paper, we present a novel efficient DBF(eDBF) partitioned scheduling algorithm. A criterion which tracks the demand bound function exactly as needed is used to avoid the incorrect judgment in determining whether a processor can accommodate an additional task in the new algorithm. We give the pseudo code of the new algorithm on least-number processors and fixed-number processors respectively. Then, we prove the correctness of, and evaluated the effectiveness of this new algorithm. The experimental results demonstrate that eDBF has better performance than DBF* and Density algorithms.