Citation
Optimal and Approximate Periodic Task Scheduling with Storage Requirement Minimization. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 480-489, 2007.
Paper
Abstract
In this paper, we study an exact formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We present a new theoretical framework that allows an early optimization of periodic storage requirement. This is based on inserting some storage dependence edges (storage reuse edges) labeled with reuse distances directly on the data dependence graph. In this new graph, we are able to fix the storage requirement measured as the exact number of necessary storage locations. The determination of storage and distance reuse is parametrized by the desired minimal execution period (resp. maximal execution throughput) as well as by the storage requirement constraints - either can be minimized while the other one is bounded, or alternatively, both are bounded.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-480-489-P, author = {S-A-A. Touati},
title = {Optimal and Approximate Periodic Task Scheduling with Storage Requirement Minimization},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {480--489},
note = {Paper},
abstract = {In this paper, we study an exact formulation of the general problem of one-dimensional periodic task scheduling under storage requirement, irrespective of machine constraints. We present a new theoretical framework that allows an early optimization of periodic storage requirement. This is based on inserting some storage dependence edges (storage reuse edges) labeled with reuse distances directly on the data dependence graph. In this new graph, we are able to fix the storage requirement measured as the exact number of necessary storage locations. The determination of storage and distance reuse is parametrized by the desired minimal execution period (resp. maximal execution throughput) as well as by the storage requirement constraints - either can be minimized while the other one is bounded, or alternatively, both are bounded.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-480-489-P.pdf} }