Departmental Papers (CIS)

Date of this Version

12-2009

Document Type

Conference Paper

Comments

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

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.

Subject Area

CPS Real-Time

Publication Source

ACM SIGBED Review

Volume

7

Issue

1

Start Page

Article No. 5

DOI

10.1145/1851166.1851173

Copyright/Permission Statement

© ACM 2010. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in ACM SIGBED Review: Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS), http://dx.doi.org/10.1145/1851166.1851173.

Share

COinS
 

Date Posted: 27 January 2011

This document has been peer reviewed.