Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00637210
Contributor : Sid Touati <>
Submitted on : Monday, October 31, 2011 - 12:08:18 PM
Last modification on : Friday, January 10, 2020 - 3:42:20 PM
Long-term archiving on: : Thursday, November 15, 2012 - 10:50:49 AM

File

Efficient_Method_for_Periodic_...
Files produced by the author(s)

Identifiers

Collections

Citation

Karine Deschinkel, Sid Touati. Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization. Second International Conference, COCOA 2008, Aug 2008, St. John's, Newfoundland and Labrador, Canada. pp.438-447, ⟨10.1007/978-3-540-85097-7_41⟩. ⟨inria-00637210⟩

Share

Metrics

Record views

156

Files downloads

323