Daniel Jelkmann

  • Citations Per Year
Learn More
The feasibility test for synchronous task systems scheduled by EDF is a well known problem in the literature. However, the analysis of task systems with deadlines shorter than the periods of the tasks has a high runtime complexity. This problem increases if we consider asynchronous task sets. In this paper, the runtime complexity of Pellizzoni’s approach to(More)
  • 1