【24h】

A New Carried-Dependence Self-scheduling Algorithm

机译:一种新的携带依赖自调度算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper we present an analysis on a shared memory system of five self-scheduling algorithms running on top of the threads programming model to schedule the loop with cross-iteration dependence. Four of them are well-known: self-scheduling (SS), chunked self-scheduling (CSS), guided self-scheduling (GSS) and factoring. Because these schemes are all for loops without cross-iteration dependence, we study the modification of these schemes to schedule the loop with cross-iteration dependence. The fifth is our proposal: carried-dependence self-scheduling (CDSS). The experiments conducted in varying parameters clearly show that CDSS outperforms other modified self-scheduling approaches in a number of simulations. CDSS, modified SS, factoring, GSS and CSS are executed efficiently in order of execution time.
机译:在本文中,我们对在线程编程模型顶部运行的五种自调度算法的共享内存系统进行了分析,以调度具有交叉迭代依赖性的循环。其中四个是众所周知的:自调度(SS),分块自调度(CSS),引导式自调度(GSS)和分解。因为这些方案都是针对没有交叉迭代依赖性的循环,所以我们研究了对这些方案的修改以调度具有交叉迭代依赖性的循环。第五是我们的建议:随身依赖自调度(CDSS)。在各种参数下进行的实验清楚地表明,CDSS在许多模拟中均优于其他修改后的自调度方法。 CDSS,修改后的SS,分解,GSS和CSS会按执行时间顺序高效执行。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号