Research Article
EDF-Adaptive: A New Semipartitioned Scheduling Algorithm for Multiprocessor Real-Time
Algorithm 1
Find complementary tasks.
| Input: : the sequence number of the task with minimum utilization | | : the sequence number of the task with maximum utilization | | : the remanent utilization and initial value is when the system is full utilization system | | : the set of all tasks in the system with their utilization in descending order | | Output: Setcomp: the complementary task set. | | 1: if and and then | | 2: if then | | 3:; | | 4: ; | | 5: ; | | 6: return 1; | | 7: else | | 8: if then | | 9 | | 10; | | 11 | | 12; | | 13: else: | | 14: if then | | 15: if then | | 16; | | 17; | | 18: ; | | 19: return 1; | | 20: else | | 21: if then | | 22: ; | | 23: ; | | 24: ; | | 25: return 1; | | 26: end if | | 27: end if | | 28: end if | | 29: end if | | 30: end if | | 31: | | 32: if then. | | 33: | | 34: return 0; | | 35: end if | | 36: end if |
|