On Multiprocessor Utility Accrual Real-Time Scheduling with Statistical Timing Assurances

We present the first Utility Accrual (or UA) real-time scheduling algorithm for multiprocessors, called gMUA. The algorithm considers an application model where real-time activities are subject to time/utility function time constraints, variable execution time demands, and resource overloads where the total activity utilization demand exceeds the total capacity of all processors. We consider the scheduling objective of (1) probabilistically satisfying lower bounds on each activity's maximum utility and (2) maximizing the system-wide, total accrued utility. We establish several properties of gMUA including optimal total utility (for a special case), conditions under which individual activity utility lower bounds are satisfied, a lower bound on system-wide total accrued utility, and bounded sensitivity for assurances to variations in execution time demand estimates. Our simulation experiments validate our analytical results and confirm the algorithm's effectiveness and superio...

• Type: Conference
• Year: 2006
• Where: EUC
• Authors: Hyeonjoong Cho, Haisang Wu, Binoy Ravindran, E. Douglas Jensen
• Keywords: Applied Computing, EUC 2006, Execution Time Demand, Lower Bound, Total Accrued Utility