Aperiodic Scheduling

Embedded System

This set of Embedded Systems Multiple Choice Questions & Answers (MCQs) focuses on “Aperiodic Scheduling”.

1. Which algorithm is based on Jackson’s rule?
a) EDD
b) LL
c) EDF
d) LST

2. What does EDD stand for?
a) earliest device date
b) earliest due date
c) earliest device deadline
d) earliest deadline device

3. Which of the following can be implemented as static scheduling algorithm?
a) EDF
b) LL
c) EDD
d) LST

4. What does EDF stand for?
a) earliest deadline fix
b) earliest due fix
c) earliest due first
d) earliest deadline first

5. Which algorithm is dynamic scheduling algorithm?
a) LL
b) LST
c) EDF
d) EDD

6. In which scheduling, the task priorities are a monotonically decreasing function of laxity?
a) LL
b) EDD
c) EFD
d) LST

7. Which scheduling algorithm is an optimal scheduling policy for mono-processor system?
a) preemptive algorithm
b) LST
c) EDD
d) LL

8. Which scheduling algorithm cannot be used with a standard OS providing fixed priorities?
a) LL
b) LST
c) EDD
d) EFD

9. Who proposed the LDF algorithm?
a) Bayes
b) Nyquist
c) Lawler
d) Stankovic

10. What does LDF stand for?
a) last deadline first
b) least deadline first
c) list deadline first
d) latest deadline first

11. Which algorithm is non-preemptive and can be used with a mono processor?
a) LDF
b) pre-emptive
c) aperiodic
d) LL

12. Which algorithm requires the periodic checks of the laxity?
a) LST
b) LL
c) EDD
d) EFD

13. Who developed the heuristic algorithm?
a) Stankovic and Ramamritham
b) Stankovic and Lawler
c) Lawler
d) Stankovic

14. Which algorithm can be used if the preemptive is not allowed?
a) heuristic algorithm
b) LL
c) EDD
d) LST

15. Deadline interval – execution time =
a) laxity
b) execution time
c) deadline interval
d) period

Leave a Reply

Your email address will not be published. Required fields are marked *