A Survey of Hard Real-Time Scheduling for Multiprocessor Systems
A Survey of Hard Real-Time Scheduling for Multiprocessor Systems
复制标题
DOI：
10.1145/1978802.1978814
复制
发表时间：
2011-10-01
影响因子：
16.6
通讯作者：
Burns, Alan
中科院分区：
文献类型：
--
作者：
Davis, Robert I.;Burns, Alan
该调查涵盖了均匀多处理器系统的硬实时调度算法和可调度性分析技术。它回顾了该领域的关键结果，从1960年代后期到2009年底发表的最新研究。该调查概述了有关实时时间表的基本结果，这些结果独立于采用的调度算法。它提供了不同调度方法的分类法，并考虑了可用于比较目的的各种性能指标。提供了详细的审查，涵盖了分区，全球和混合计划算法，资源共享方法以及实证研究的最新结果。该调查确定了开放问题，关键的研究挑战以及可能的生产研究方向。
This survey covers hard real-time scheduling algorithms and schedulability analysis techniques for homogeneous multiprocessor systems. It reviews the key results in this field from its origins in the late 1960s to the latest research published in late 2009. The survey outlines fundamental results about multiprocessor real-time scheduling that hold independent of the scheduling algorithms employed. It provides a taxonomy of the different scheduling methods, and considers the various performance metrics that can be used for comparison purposes. A detailed review is provided covering partitioned, global, and hybrid scheduling algorithms, approaches to resource sharing, and the latest results from empirical investigations. The survey identifies open issues, key research challenges, and likely productive research directions.