Test: Classification of Scheduling Algorithms - Computer Science Engineering (CSE) MCQ

Explanation: The real-time scheduling can be classified into various criteria. The fundamental classification is the software and hardware deadline which is based on the extension to standard operating systems.

Explanation: The periodic task is the one which must be executed in a defined unit of time say ‘p’ where p is called the period.

Explanation: The aperiodic task is the one in which the task are not periodic but the periodic task is the one in which are the task are periodic. Each execution of a periodic task is known as the job.

Explanation: The aperiodic tasks request the processor at unpredictable times if and only if there is a minimum separation between the times at which they request the processor which is called sporadic.

Explanation: The nonpreemptive scheduling is based on the assumptions that the tasks are executed until the task is done whereas the preemptive scheduling is used if the task has long execution times or for a short response time.

Explanation: The static scheduler take their designs at the design time and it also generates tables of start times which are forwarded to a simple dispatcher but the dynamic scheduler takes decision at the run-time.

Explanation: The dynamic schedulers take decisions at run-time and they are quite flexible, but generate overhead at run-time whereas static scheduler is the ones in which the scheduler take their designs at the design time.

Explanation: The static scheduler generates tables of start times which are forwarded to a simple dispatcher and it can be controlled by a timer which makes the dispatcher analyze the table.

Explanation: The systems which are entirely controlled by a timer are known as entirely time-triggered systems. A temporal control structure is associated with the entirely time-triggered system which is encoded in a TDL, task descriptor list.

Explanation: TDL is a task descriptor list which contains the cyclic schedule for all activities of the node and the temporal control structure is encoded by the task descriptor table.

Explanation: The complex algorithm is used in mixed software/hardware systems. It can be used to handle multiple processors.

Explanation: The simple algorithm can be used in handling single processors and the complex algorithm is used in mixed both in software and the hardware systems. It can also be used to distinguish homogeneous multiprocessor system and heterogeneous multiprocessor systems. The complex algorithm can be used to handle multiple processors whereas .

Explanation: The necessary and sufficient conditions are used in the schedulability test. For necessary condition, the test is based only on the necessary conditions and it also can be used to show that no schedule exists. The sufficient condition indicates that no schedule exists even if there exist one.

Explanation: The sufficient condition indicates that no schedule exists even if there exist one and the necessary condition indicates that no schedule exists even if a schedule exists.

Explanation: The online scheduling algorithm schedule tasks at run-time which is based on the information regarding the task whereas offline algorithms schedule tasks take a priori knowledge about the execution times, arrival times and deadlines into account.