Swapping to reduce preemptions and migrations in EKG

  • Authors:
  • Geoffrey Nelissen;Shelby Funk;Joël Goossens;Dragomir Milojevic

  • Affiliations:
  • Université Libre de Bruxelles (ULB), Brussels, Belgium;University of Georgia Athens, GA;Université Libre de Bruxelles (ULB), Brussels, Belgium;Université Libre de Bruxelles (ULB), Brussels, Belgium

  • Venue:
  • ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

EKG is a multiprocessor scheduling algorithm which is optimal for the schedule of real-time periodic tasks with implicit deadlines. It adheres to the deadline partitioning fair (DP-Fair) approach. However, it was shown in recent studies that the systematic execution of some tasks inherent in such approaches, significantly reduce the usability of this algorithm. Hence, we propose a swapping algorithm with the aim of reducing the number of preemptions and migrations incurred by EKG. This algorithm should enhance the practicality of EKG while keeping its optimality.