1.

Which scheduling is the basis for a number of formal proofs of schedulability?(a) LL(b) RMS(c) LST(d) EDDI had been asked this question in an international level competition.My doubt stems from Periodic Scheduling topic in chapter Embedded Operating System, Middleware and Scheduling of Embedded Systems

Answer» RIGHT option is (b) RMS

To elaborate: The rate monotonic SCHEDULING which is an INDEPENDENT scheduling algorithm form the basis for a NUMBER of FORMAL proofs of schedulability.


Discussion

No Comment Found

Related InterviewSolutions