List Scheduling in Embedded Systems Under Memory Constraints
List Scheduling in Embedded Systems Under Memory Constraints
复制标题
DOI：
10.1007/s10766-014-0338-1
复制
发表时间：
2013-10
影响因子：
1.5
通讯作者：
P. Arras;D. Fuin;E. Jeannot;Arthur Stoutchinin;Samuel Thibault
中科院分区：
文献类型：
--
作者：
P. Arras;D. Fuin;E. Jeannot;Arthur Stoutchinin;Samuel Thibault
嵌入式系统中的视频解码和图像处理受到严格的资源限制，特别是在内存方面。具有静态优先级的列表调度启发式（HEFT、SDC 等）由于其良好的性能和低复杂性而成为经常被引用的解决方案，我们提出了一种旨在将内存概念引入其中的方法。此外，我们表明，通过充分调整任务优先级并明智地采用基于插入的策略，可以实现高达 20% 的加速。我们还表明，与经典的列表调度启发法相比，我们的技术可以防止死锁并大大减少所需的内存占用。最后，我们提出了一种方法来评估动态调度在这种情况下的适当性。
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 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.