Reference no: EM132158162
Use at least ONE EXAMPLE FOR EACH STATEMENT BELOW to explain if the following statements are true or false.
1. RMA is an optimal fixed priority assignment policy for periodic real-time task sets.
2. For homogeneous multiprocessor scheduling, the partitioning approach is superior to the non-partitioning approach.
3. For a single processor, the Liu and Layland utilization bound is just a sufficient condition to check the feasibility when scheduling a real-time periodic task set with each task's period equal to its deadline.
4. Let m periodic tasks (with its deadline equal to its period) be scheduled in n homogeneous processors by EDF, then the utilization bound is 1.
5. Both RMS and EDF are sustainable to schedule real-time tasks on multiple homogeneous processors.
6. EDF is always the optimal scheduling method when scheduling tasks on a single processor.
7. When you formulate a linear programming problem with linear objective and constraints, you can always get the optimal solution using a linear programming solver.
8. For a processor with dynamic voltage/frequency scaling capability, to set the processor speed as low as possible can always minimize the overall energy consumption.