Association for Computing Machinery
A time slot is defined as contention-free if the number of jobs with remaining executions in the slot is no larger than the number of processors, or contending, otherwise. Then an important property holds that in any contention-free slot, all jobs with remaining executions are guaranteed to be scheduled as long as the scheduler is work-conserving. This paper aims at improving schedulability by utilizing the contention-free slots. To achieve this, this paper presents a policy (called CF policy) that moves some job executions from contending slots to contention-free ones.