On multiprocessor utility accrual real-time scheduling with statistical timing assurances

  • Authors:
  • Hyeonjoong Cho;Haisang Wu;Binoy Ravindran;E Douglas Jensen

  • Affiliations:
  • ECE Dept., Virginia Tech, Blacksburg, VA;Juniper Networks, Inc., Sunnyvale, CA;ECE Dept., Virginia Tech, Blacksburg, VA;The MITRE Corporation, Bedford, MA

  • Venue:
  • EUC'06 Proceedings of the 2006 international conference on Embedded and Ubiquitous Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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 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 confirm our analysis and illustrate the algorithm's effectiveness