Aperiodic Scheduling MCQ Quiz – Objective Question with Answer for Aperiodic Scheduling

The EDD or earliest due date is based on Jackson’s rule. Jackson’s rule states that for a given set of n independent tasks, any algorithm that executes the tasks in the order of nondecreasing deadlines is optimal with respect to reducing the maximum lateness. EDF is the earliest deadline first, LL is the least laxity and the LST is the least slack time first.

The earliest due date requires all tasks to be sorted by their deadlines and it is based on Jackson’s rule. If the deadlines are known, the EDD algorithm can be used.

The EDD can be implemented as a static scheduling algorithm if the deadlines are known in advance and it follows Jackson’s rule.

The EDF stands for earliest deadline first. This algorithm is optimal with respect to minimizing the maximum lateness and is implemented as a dynamic scheduling algorithm for a set of n independent tasks with arbitrary arrival times, any algorithm that at any instant executes the task with the earliest absolute deadline among all the ready tasks is optimal with respect to minimizing the maximum lateness.

The EDF or earliest deadline first can be implemented as a dynamic scheduling algorithm.

In the least laxity algorithm, the laxity can be changed dynamically which shows that the task priorities are a monotonically decreasing function of laxity.

The least laxity algorithm is a dynamic scheduling algorithm and hence it can be implemented as an optimal scheduling policy for the mono-processor system. The LL scheduling algorithm is also preemptive scheduling.

The least laxity algorithm cannot be used with a standard OS providing fixed priorities because of its dynamic property.

The latest deadline first or LDF is proposed by Lawler which performs a topological sort. It is based on the total order compatible with the partial order with respect to the task graph.

The LDF or latest deadline first is a scheduling algorithm which is proposed by Lawler.