Efficient Method for Periodic Task Scheduling with Storage Requirement Minimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
Efficient_Method_for_Periodic_Task.pdf (88.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00637210 , version 1 (31-10-2011)

Identifiers

Cite

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⟩

Collections

CNRS UVSQ
55 View
211 Download

Altmetric

Share

Gmail Facebook X LinkedIn More