Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization

Abstract. In this paper, we study an efficient approximate integer linear programming formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We have already presented in [8] a theoretical framework that allows an optimal optimization of periodic storage requirement in a periodic schedule. This problem is used to optimise processor register usage in embedded systems. Our storage optimisation problem being NP-complete [7], solving an exact integer linear programming formulation as proposed in [8] is too expensive in practice. In this article, we give an efficient approximate model that allows fast resolution times while providing nearly optimal results. Our solution has been implemented and included inside a compiler for embedded processors.

• Type: Conference
• Year: 2008
• Where: COCOA
• Authors: Karine Deschinkel, Sid Ahmed Ali Touati
• Keywords: COCOA 2008, Discrete Geometry, Integer Linear Programming, Linear Programming Formulation, Storage Requirement