By Topic

Gang EDF Scheduling of Parallel Task Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kato, S. ; Grad. Sch. of Inf. Sci. & Technol., Univ. of Tokyo, Tokyo, Japan ; Ishikawa, Y.

The preemptive real-time scheduling of sporadic parallel task systems is studied. We present an algorithm, called gang EDF, which applies the earliest deadline first (EDF) policy to the traditional gang scheduling scheme. We also provide schedulability analysis of gang EDF. Specifically, the total amount of interference that is necessary to cause a deadline miss is first identified. The contribution of each task to the interference is then bounded. Finally, verifying that the total amount of contribution does not exceed the necessary interference for every task, the schedulability test is derived. Although the techniques proposed herein are based on the prior results for the sequential task model, we introduce new ideas for the parallel task model.

Published in:

Real-Time Systems Symposium, 2009, RTSS 2009. 30th IEEE

Date of Conference:

1-4 Dec. 2009