首页> 外文OA文献 >Task scheduling techniques for asymmetric multi-core systems
【2h】

Task scheduling techniques for asymmetric multi-core systems

机译:非对称多核系统的任务调度技术

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

As performance and energy efficiency have become the main challenges for next-generation high-performance computing, asymmetric multi-core architectures can provide solutions to tackle these issues. Parallel programming models need to be able to suit the needs of such systems and keep on increasing the application's portability and efficiency. This paper proposes two task scheduling approaches that target asymmetric systems. These dynamic scheduling policies reduce total execution time either by detecting the longest or the critical path of the dynamic task dependency graph of the application, or by finding the earliest executor of a task. They use dynamic scheduling and information discoverable during execution, fact that makes them implementable and functional without the need of off-line profiling. In our evaluation we compare these scheduling approaches with two existing state-of the art heterogeneous schedulers and we track their improvement over a FIFO baseline scheduler. We show that the heterogeneous schedulers improve the baseline by up to 1.45× in a real 8-core asymmetric system and up to 2.1× in a simulated 32-core asymmetric chip. © 2016 IEEE.
机译:由于性能和能源效率已经成为下一代高性能计算的主要挑战,因此非对称多核体系结构可以提供解决这些问题的解决方案。并行编程模型需要能够适应此类系统的需求,并不断提高应用程序的可移植性和效率。本文提出了两种针对非对称系统的任务调度方法。这些动态调度策略可以通过检测应用程序的动态任务依赖关系图的最长或关键路径,或者通过查找任务的最早执行者来减少总执行时间。它们使用动态调度和执行期间可发现的信息,这使得它们无需离线分析即可实现且功能正常。在我们的评估中,我们将这些调度方法与两个现有的最新异构调度器进行了比较,并跟踪它们在FIFO基准调度器上的改进。我们显示,异构调度程序在实际的8核非对称系统中将基线提高了1.45倍,在模拟的32核非对称芯片中将基线提高了2.1倍。 ©2016 IEEE。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号