Multiprocessor Real-Time Scheduling Considering Concurrency and Urgency

Loading...
Thumbnail Image
Penn collection
Departmental Papers (CIS)
Degree type
Discipline
Subject
CPS Real-Time
Computer Engineering
Engineering
Funder
Grant number
License
Copyright date
Distributor
Related resources
Contributor
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.

Advisor
Date of presentation
2009-12-01
Conference name
Departmental Papers (CIS)
Conference dates
2023-05-17T05:55:50.000
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Journal Issue
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
Recommended citation
Collection