Provided by: Reed Business Information
Date Added: Jan 2010
The authors consider optimal real-time scheduling of periodic tasks on multiprocessors-i.e., satisfying all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. They introduce a novel abstraction for reasoning about task execution behavior on multiprocessors, called T-L plane and present T-L plane-based real-time scheduling algorithms. They show that scheduling for multiprocessors can be viewed as scheduling on repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in an optimal schedule.