Departmental Papers (CIS)
Document Type
Conference Paper
Date of this Version
12-2009
Abstract
It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies find optimal scheduling policies for implicit deadline task systems, but it is hard to understand how each policy utilizes the two important aspects of scheduling real-time tasks on multiprocessors: inter-job concurrency and job urgency. In this paper, we introduce a new scheduling policy that considers these two properties. We prove that the policy is optimal for the special case when the execution time of all tasks are equally one and deadlines are implicit, and observe that the policy is a new concept in that it is not an instance of Pfair or ERfair. It remains open to find a scheduliability condition for general task systems under our scheduling policy.
Date Posted: 27 January 2011
This document has been peer reviewed.
Comments
Suggested Citation:
J. Lee, A. Easwaran, I. Shin and I. Lee. (2010). "Multiprocessor Real-Time Scheduling Considering Concurrency and Urgency." SIGBED Review. Vol. 7(1). Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS), Washington, D.C., December 1-4, 2009.
http://sigbed.seas.upenn.edu/vol7_num1.html