Gang scheduling in multi-core clusters implementing migrations
Gang scheduling in multi-core clusters implementing migrations
复制标题
DOI：
10.1016/j.future.2011.02.010
复制
发表时间：
2011-10
期刊：
影响因子：
--
通讯作者：
Zafeirios C. Papazachos;H. Karatza
中科院分区：
文献类型：
--
作者：
Zafeirios C. Papazachos;H. Karatza
合理的调度算法对于有效利用复杂分布式系统的可用资源至关重要。调度算法负责将可用的系统资源分配给现有的作业。多核处理器的出现对芯片提出了新的要求。在本文中，我们研究了组调度算法的性能，同构和异构集群组成的多核处理器。此外，迁移方案的建议，这是适合调度组在多核集群。仿真模型用于提供系统性能的结果。
A proper scheduling algorithm is essential for the efficient utilization of the available resources of complex distributed systems. The scheduling algorithm is responsible for allocating the available system resources to the existing jobs. The emergence of multi-core processors poses new demands on schedulers. In this paper, we study the performance of gang scheduling algorithms for homogeneous and heterogeneous clusters which consist of multi-core processors. Furthermore, a migration schema is suggested which is suitable for scheduling gangs in multi-core clusters. A simulation model is used to provide results on the performance of the system.