Slack-based global multiprocessor scheduling of aperiodic tasks in parallel embedded real-time systems

  • Authors:

  • Lars Lundberg;Hakan Lennerstad

  • Affiliations:

  • Department of Systems and Software, School of Engineering, Blekinge Institute of Technology, 372 25 Ronneby, Sweden;Department of Systems and Software, School of Engineering, Blekinge Institute of Technology, 372 25 Ronneby, Sweden

  • Venue:
  • AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

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%).