Loading [a11y]/accessibility-menu.js
A binary integer linear programming-based approach for solving the allocation problem in multiprocessor partitioned scheduling | IEEE Conference Publication | IEEE Xplore

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


Abstract:

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 ...Show More

Abstract:

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.
Date of Conference: 26-28 October 2011
Date Added to IEEE Xplore: 19 December 2011
ISBN Information:
Conference Location: Merida City, Mexico

References

References is not available for this document.