Darera, Vivek N and Jenkinsb, Lawrence (2006) Utilization bounds for RM scheduling on uniform multiprocessors. In: 12th International Conference on Embedded and Real-Time Computing Systems and Applications, AUG 16-18, 2006, Sydney, AUSTRALIA, pp. 315-321.
getPDF.pdf000.pdf - Published Version
Restricted to Registered users only
Download (168Kb) | Request a copy
Utilization bounds for Earliest Deadline First(EDF) and Rate Monotonic(RM) scheduling are known and well understood for uniprocessor systems. In this paper, we derive limits on similar bounds for the multiprocessor case, when the individual processors need not be identical. Tasks are partitioned among the processors and RM scheduling is assumed to be the policy used in individual processors. A minimum limit on the bounds for a 'greedy' class of algorithms is given and proved, since the actual value of the bound depends on the algorithm that allocates the tasks. We also derive the utilization bound of an algorithm which allocates tasks in decreasing order of utilization factors. Knowledge of such bounds allows us to carry out very fast schedulability tests although we are constrained by the fact that the tests are sufficient but not necessary to ensure schedulability.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Engineering|
|Date Deposited:||26 Aug 2010 04:21|
|Last Modified:||19 Sep 2010 06:12|
Actions (login required)