• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Developing Graph-Based Co-Scheduling Algorithms on Multicore Computers
【24h】

Developing Graph-Based Co-Scheduling Algorithms on Multicore Computers

机译：在多核计算机上开发基于图的协同调度算法

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

It is common that multiple cores reside on the same chip and share the on-chip cache. As a result, resource sharing can cause performance degradation of co-running jobs. Job co-scheduling is a technique that can effectively alleviate this contention and many co-schedulers have been reported in related literature. Most solutions however do not aim to find the optimal co-scheduling solution. Being able to determine the optimal solution is critical for evaluating co-scheduling systems. Moreover, most co-schedulers only consider serial jobs, and there often exist both parallel and serial jobs in real-world systems. In this paper a graph-based method is developed to find the optimal co-scheduling solution for serial jobs; the method is then extended to incorporate parallel jobs, including multi-process, and multi-threaded parallel jobs. A number of optimization measures are also developed to accelerate the solving process. Moreover, a flexible approximation technique is proposed to strike a balance between the solving speed and the solution quality. Extensive experiments are conducted to evaluate the effectiveness of the proposed co-scheduling algorithms. The results show that the proposed algorithms can find the optimal co-scheduling solution for both serial and parallel jobs. The proposed approximation technique is also shown to be flexible in the sense that we can control the solving speed by setting the requirement for the solution quality.
机译：通常，多个内核驻留在同一芯片上并共享片上缓存。结果，资源共享可能导致并发作业的性能下降。作业协同调度是一种可以有效缓解这种竞争的技术，相关文献已经报道了许多协同调度。然而，大多数解决方案并不旨在找到最佳的协同调度解决方案。能够确定最佳解决方案对于评估协​​同调度系统至关重要。而且，大多数协同调度程序仅考虑串行作业，并且在实际系统中通常同时存在并行作业和串行作业。本文提出了一种基于图的方法来找到串行作业的最佳协同调度解决方案。然后将该方法扩展为合并并行作业，包括多进程和多线程并行作业。还开发了许多优化措施来加速求解过程。此外，提出了一种灵活的近似技术以在求解速度和求解质量之间取得平衡。进行了广泛的实验，以评估所提出的协同调度算法的有效性。结果表明，所提出的算法可以为串行和并行作业找到最佳的协同调度解决方案。从我们可以通过设置求解质量的要求来控制求解速度的角度来看，所提出的近似技术也显示出了灵活性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号