A Novel Partitioned Scheduling Algorithm of Constrained-deadline Sporadic Task Systems on Multiprocessors
|
| Title | A Novel Partitioned Scheduling Algorithm of Constrained-deadline Sporadic Task Systems on Multiprocessors |
| Authors | |
| Abstract | In this paper, a novel efficient DBF (eDBFc) partitioned scheduling algorithm of constrained-deadline sporadic task systems on multiprocessors is proposed. A criterion which tracks the demand bound function exactly as needed is used in the novel algorithm. The using of the new criterion in eDBFc avoids the incorrect judgment made by density algorithm and DBF* algorithm in determining whether a processor can accommodate an additional task. We give the pseudo code of the new algorithm on least-number processors and fixed-number processors respectively, and derive the sufficient and necessary conditions for success of our algorithm. The experimental results show the superiority of the proposed algorithm over density algorithm and DBF* algorithm. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2010-10-01 |
| Source | Journal of Computers Vol 5, No 10 (2010): Special Issue: Selected Papers of The Second International Conference on Signa |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |