List Scheduling in Embedded Systems under Memory Constraints

Paul-Antoine Arras 1, 2 Didier Fuin 2 Emmanuel Jeannot 1, 3 Arthur Stoutchinin 4 Samuel Thibault 3
1 RUNTIME - Efficient runtime systems for parallel architectures
Inria Bordeaux - Sud-Ouest, UB - Université de Bordeaux, CNRS - Centre National de la Recherche Scientifique : UMR5800
4 STHORM
ST-GRENOBLE - STMicroelectronics [Grenoble]
Abstract : Video decoding and image processing in embedded systems are subject to strong resource constraints, particularly in terms of memory. List-scheduling heuristics with static priorities (HEFT, SDC, etc.) being the oft-cited solutions due to both their good performance and their low complexity, we propose a method aimed at introducing the notion of memory into them. Moreover, we show that through appropriate adjustment of task priorities and judicious resort to insertion-based policy, speedups up to 20\% can be achieved. Lastly, we show that our technique allows to prevent deadlock and to substantially reduce the required memory footprint compared to classic list-scheduling heuristics.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download

https://hal.inria.fr/hal-00906117
Contributor : Paul-Antoine Arras <>
Submitted on : Tuesday, November 19, 2013 - 11:39:40 AM
Last modification on : Thursday, December 20, 2018 - 3:36:05 PM
Document(s) archivé(s) le : Monday, March 3, 2014 - 2:25:27 PM

File

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

Identifiers

Citation

Paul-Antoine Arras, Didier Fuin, Emmanuel Jeannot, Arthur Stoutchinin, Samuel Thibault. List Scheduling in Embedded Systems under Memory Constraints. SBAC-PAD'2013 - 25th International Symposium on Computer Architecture and High-Performance Computing, Federal University of Pernambuco & Federal University of Minas Gerais, Oct 2013, Porto de Galinhas, Brazil. pp.152-159, ⟨10.1109/SBAC-PAD.2013.22⟩. ⟨hal-00906117⟩

Share

Metrics

Record views

517

Files downloads

364