Task scheduling

Task scheduling
复制标题

任务调度

DOI:
10.1145/2560015
复制
发表时间:
2014
期刊:
ACM Transactions on Embedded Computing Systems (TECS)
影响因子:
--
通讯作者:
A. Leva
A. Leva
中科院分区:
--
文献类型:
--
作者:
M. Maggio;F. Terraneo;A. Leva

文献摘要

被引文献

相似文献

本文提出了一种设计任务调度算法的新方法,其中始终使用系统理论方法论。该建议意味着对主流设计实践的重大视角转变,但在简单性、灵活性、不同问题的解决方案一致性以及在存在不可预测的运行时情况下正式评估结果的可能性方面产生了巨大的回报。文中给出了一个完整的实现实例,以及各种比较测试和有关该问题的方法论论述。
This article presents a new approach to the design of task scheduling algorithms, where system-theoretical methodologies are used throughout. The proposal implies a significant perspective shift with respect to mainstream design practices, but yields large payoffs in terms of simplicity, flexibility, solution uniformity for different problems, and possibility to formally assess the results also in the presence of unpredictable run-time situations. A complete implementation example is illustrated, together with various comparative tests, and a methodological treatise of the matter.