Hits:

Indexed by:期刊论文

Date of Publication:2012-01-01

Journal:JOURNAL OF SUPERCOMPUTING

Included Journals:Scopus、SCIE、EI

Volume:59

Issue:1

Page Number:227-245

ISSN No.:0920-8542

Key Words:Multiprocessors; Sporadic tasks; Partitioned scheduling

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