The Community for Technology Leaders
2008 IEEE/ACS International Conference on Computer Systems and Applications (2008)
Doha, Qatar
Mar. 31, 2008 to Apr. 4, 2008
ISBN: 978-1-4244-1967-8
pp: 465-472
Lars Lundberg , Department of Systems and Software, School of Engineering, Blekinge Institute of Technology, 372 25 Ronneby, Sweden
Hakan Lennerstad , Department of Systems and Software, School of Engineering, Blekinge Institute of Technology, 372 25 Ronneby, Sweden
ABSTRACT
We provide a constant time schedulability test and priority assignment algorithm for an on-line multiprocessor server handling aperiodic tasks. Dhall’s effect is avoided by dividing tasks in two priority classes based on their utilization: heavy and light. The improvement in this paper is due to assigning priority of light tasks based on slack - not on deadlines. We prove that if the load on the multiprocessor stays below (3 − √5) / 2 ≈ 38.197% , the server can accept an incoming aperiodic task and guarantee that the deadlines of all accepted tasks will be met. This is better than the current state-of-the-art algorithm where the priorities of light tasks are based on deadlines (the corresponding bound is in that case 35.425%).
INDEX TERMS
CITATION

H. Lennerstad and L. Lundberg, "Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems," 2008 IEEE/ACS International Conference on Computer Systems and Applications(AICCSA), Doha, Qatar, 2008, pp. 465-472.
doi:10.1109/AICCSA.2008.4493574
96 ms
(Ver 3.3 (11022016))