0

I try to decide schedulability of non-preemptive periodic tasks with same priorities. I have found a question on: Non preemptive Earliest deadline first scheduling, however the tasks were not periodic. The question is, whether periodic tasks may obtain a higher schedulability bound?

Community
  • 1
  • 1
HaloPid
  • 1
  • Could you clarify what do you exactly mean by higher schedulability bound? – n3wcod3r Jul 02 '15 at 05:28
  • it is like the schedulability test for preemptive RMS by Liu & Layland. If the cpu utilization is below 0.69 i am sure RMS will schedule it correctly. I'd like to have something similar for non-preemptive scheduling. – HaloPid Jul 02 '15 at 12:59
  • The tasks were scheduled periodically in the question you mention – vicch Oct 26 '15 at 11:11

0 Answers0