Documente Academic
Documente Profesional
Documente Cultură
Ketan Ghai Dheerendra Singh Anubhav Singh Keshav Mahawer Amit Patel Ritesh Shukla
Types of Tasks
Periodic task
Triggered at fixed periods by a timer
Aperiodic task
Triggered by external interrupts
Sporadic task
Triggered by external interrupts, but with minimum inter-arrival time (MIT) between interrupts can be treated as a periodic task with period equal to MIT We typically assume periodic task model for schedulability analysis
Very simple scheduling algorithm; every task i is assigned a fixed priority pi ; the active task with the highest priority is scheduled. Priorities are integer numbers: the higher the number, the higher the priority; In the research literature, sometimes authors use the opposite convention: the lowest the number, the highest the priority. In the following we show some examples, considering periodic tasks, and constant execution time equal to the period.
Example of schedule
Consider the following task set: 1 = (2, 6, 6), 2 = (2, 9, 9), 3 = (3, 12, 12). Task 1 has priority p1 = 3 (highest), task 2 has priority p2 = 2, task 3 has priority p3 = 1 (lowest).
Note:
Some considerations about the schedule shown before: The response time of the task with the highest priority is minimum and equal to its WCET. The response time of the other tasks depends on the interference of the higher priority tasks; The priority assignment may influence the schedulability of a task.
Priority assignment
Given a task set, how to assign priorities? There are two possible objectives: Schedulability (i.e. find the priority assignment that makes all tasks schedulable) Response time (i.e. find the priority assignment that minimize the response time of a subset of tasks). By now we consider the first objective only An optimal priority assignment Opt is such that: If the task set is schedulable with another priority assignment, then it is schedulable with priority assignment Opt. If the task set is not schedulable with Opt, then it is not schedulable by any other assignment.
Tasks with shorter relative deadline have higher priority For sporadic tasks, the same rules are valid as for periodic tasks with offsets equal to 0.
Example revised:
Consider the example shown before with deadline monotonic: 1 = (3, 6, 6), p1 = 2, 2 = (2, 4, 8), p2 = 3, 3 = (2, 10, 12), p3 = 1.
Deadline Monotonic (DM) Priority based on task deadline: smaller relative deadline, higher priority.
if Di < Dk, then i > k No fixed priority algorithm is optimal Under special cases can achieve a utilization of 1: a set of tasks are simply periodic if for every pair of tasks Ti and Tk with pi<pk, pk=mpi, m an integer. (They are harmonic) for simply periodic, independent, preemptable tasks with Di pi, a set of tasks is schedulable on a uniprocessor system iff U 1. Among fixed-priority algorithms, DM is optimal if a set of tasks can be scheduled using fixed priorities then DM will produce a feasible schedule if Dk = xpk for all k and some constant x then RM is identical to DM.
Pros:
Cons:
Cannot achieve 100% utilization in general, except when task periods are harmonic Widely used in most commercial RTOSes and CAN bus
Many persons have contributed to make this project on Schedulability Tests for Fixed Priority Tasks. We would especially like to express our appreciation to Ms Subuhi Firdaus (Faculty,Amity University) for her unstinted support, encouragement and painstakingly and meticulous effort for us.
We acknowledge the help and cooperation received from all the faculty members of Amity University. Several colleagues and students have contributed directly and indirectly to the contents of this project, as they had given me numerous ideas. Their criticism gave me the much-needed hints about the areas that needed elaboration and amendments and also to present them with greater clarity. Finally, we wish to express my sincere thanks to all our family members, especially our Parents for their constant moral support and Encouragement. We would Welcome Constructive Suggestions to improve this project, which can be implemented in my further attempts.
Thanking you!
NAME
KETAN GHAI DHEERENDRA SINGH ANUBHAV SINGH KESHAV MAHAWER AMIT PATEL RITESH SHUKLA