Computing the Minimum EDF Feasible Deadline in Periodic Systems

  title={Computing the Minimum EDF Feasible Deadline in Periodic Systems},
  author={Hoai Hoang Bengtsson and G. Buttazzo and M. Jonsson and Stefan M. Karlsson},
  journal={12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)},
  • Hoai Hoang Bengtsson, G. Buttazzo, +1 author Stefan M. Karlsson
  • Published 2006
  • Computer Science
  • 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
  • In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requirements can be met by assigning suitable relative deadlines and guaranteeing the feasibility of the schedule. This paper presents a method (called minD) for calculating the minimum EDF-feasible deadline of a real-time task. More precisely, given a set of periodic tasks with hard real-time requirements, which is feasible… CONTINUE READING
    Minimum Deadline Calculation for Periodic Real-Time Tasks in Dynamic Priority Systems
    • 40
    • Open Access
    Schedulability Analysis for Real-Time Systems with EDF Scheduling
    • 190
    • Open Access
    Sensitivity analysis of arbitrary deadline real-time systems with EDF scheduling
    • 10
    Cutting the Unnecessary Deadlines in EDF
    The Space of EDF Feasible Deadlines
    • 19
    • Open Access
    Uniprocessor EDF Feasibility is an Integer Problem
    The space of EDF deadlines: the exact region and a convex approximation
    • 22
    • Open Access
    Period sensitivity analysis and D-P domain feasibility region in dynamic priority systems
    • 6
    • Open Access


    Publications referenced by this paper.
    Minimum EDF-Feasible Deadline Calculation with Low-Time Complexity
    • 2
    • Open Access
    Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
    • 41
    • Open Access
    Analysis of Deadline Scheduled Real-Time Systems
    • 275
    • Open Access
    Scheduling Distributed Real-Time Tasks with Minimum Jitter
    • 48
    Scheduling aperiodic tasks in dynamic priority systems
    • 351
    • Open Access
    Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor
    • 544
    • Highly Influential
    Scheduling periodic task systems to minimize output jitter
    • 107
    • Open Access
    Preemptively scheduling hard-real-time sporadic tasks on one processor
    • 686
    • Highly Influential
    Dynamic integrated scheduling of hard real-time, soft real-time, and non-real-time processes
    • 191
    • Open Access