Research Article
Static Scheduling of Periodic Hardware Tasks with Precedence and Deadline Constraints on Reconfigurable Hardware Devices
Algorithm 3
Search of overlapping execution intervals and RZ loads.
| (1) // Tasks | | (2) , , , // Natural, iterations of execution of tasks | | (3) // The set of execution intervals for task during iteration | | (4) // All the possible combinations of sets of distinct tasks that give | | overlapping execution intervals on a given RZ, during | | (5) // Combination of overlapping execution intervals depicted by , | | (6) // The remaining execution time within task | | (7) The remaining period within task | | (8) // The period of conflict for a combination of overlapping execution intervals | | (9) for all iteration do | | (10) for all RZ do | | (11) = / | | (12) = one combination of overlapping execution intervals extracted from sets in . | | (13) for all in do | | (14) In , search the latest tasks in starting execution | | (15) In , search all the remaining tasks that are ready or start execution before and determine | | their remaining execution times: and their remaining periods: | | (16) ) | | (17) =) | | (18) if (, = , , , , | | = + and , = +* | | , , and and are the | | iterations from which the execution intervals are taken respectively for tasks and ) then | | (19) = / + / | | (20) else | | (21) | | (22) = / + / | | (23) end if | | (24) end for | | (25) end for | | (26) end for |
|