List Scheduling in Embedded Systems Under Memory Constraints

Abstract

International audienceVideo 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 adequate adjustment of task priorities and judicious resort to insertion-based policy, speedups up to 20% can be achieved. We also show that our technique allows to prevent deadlock and to substantially reduce the required memory footprint compared to classic list-scheduling heuristics. Lastly, we propose a methodology to assess the appropriateness of dynamic scheduling in this context

Controlling the Memory Subscription of Distributed Applications with a Task-Based Runtime System

“…A prototype for a more general resource-aware task scheduling was developed in OmpSs [15]. The topic was also studied with keen interest in the domain of embedded computing, where memory resources may drastically be limited [16], [17]. We refer to Section 4.3 of [18] for a survey of theoretical and practical memory-aware algorithms.…”