By Topic

A binary integer linear programming-based approach for solving the allocation problem in multiprocessor partitioned scheduling

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

3 Author(s)
Puente-Maury, L. ; Dept. of Comput. Sci., CINVESTAV-IPN, Mexico City, Mexico ; Mejia-Alvarez, P. ; Leyva-del-Foyo, L.E.

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