Page 144 - DCAP608_REAL TIME SYSTEMS

Unit 14: Advance Priority-driven Scheduling of Periodic Tasks

Deadline: The latest time or date by which something should be completed. Notes
Function: It is a named section of a program that performs a specific task.
Processor: It is a program that translates another program into a form acceptable by the computer
being used.
Scheduling: It defines a policy of how to order tasks such that a metric is maximized/minimized.

14.5 Review Questions

1. What is meant by tick scheduling?
2. Briefly explain Schedulable Utilization of the RM.

3. What is Enhanced Schedulable Utilization?
4. Discuss Blocking and Priority Inversion briefly.
5. Write short notes on self-suspension and context switches.

Answers: Self Assessment

1. Time-demand 2. Deadline

3. Accurate 4. U (n)
RM
5. Processor 6. Lower-priority
7. Higher-priority 8. Clock
9. Pending 10. Scheduler

14.6 Further Readings

Books Alan Burns and Andy Wellings (2001). Real-Time Systems and Programming
Languages, Addison Wesley.
C. M. Krishna and K. G. Shin (1997). Real-Time Systems. McGraw-Hill International
Editions.
O’Reilly Editor (1995). Programming for the real world.
Ben-Ari, M. (1990). Principles of Concurrent and Distributed Programming, Prentice
Hall.

Online links parts.ulb.ac.be/index.../46-priority-driven_scheduling_of_periodic
link.springer.com/article/10.1023%2FA%3A1025120124771

www.ece.mtu.edu/faculty/shiyan/EE5900Spring13/PriorityScheduling.ppt
www.cs.unc.edu/techreports/02-025.pdf

LOVELY PROFESSIONAL UNIVERSITY 139