Referenced Items are not available for this document.
Scheduling is a main issue of real-time systems because it involves meeting the deadlines. In this paper, we address the problem of scheduling a set of periodic tasks on m processors under EDF (Earliest Deadline First) using a partitioned scheme. The allocation problem is transformed into a binary integer linear program. Then, it is solved by applying Geoffrion's version of Balas' additive method, optimized for the real-time scheduling problem. In order to assess the feasibility of the approach for a small size practical problem, some experimental results are shown.
Published in:
Electrical Engineering Computing Science and Automatic Control (CCE), 2011 8th International Conference on
Date of Conference: 26-28 Oct. 2011
- Page(s):
- 1 - 6
- Print ISBN:
- 978-1-4577-1011-7
- INSPEC Accession Number:
- 12503213
- Conference Location :
- Merida City
- Digital Object Identifier :
- 10.1109/ICEEE.2011.6106190
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
