当前位置: X-MOL 学术J. Supercomput. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dynamic scheduling of task graphs in multi-FPGA systems using critical path
The Journal of Supercomputing ( IF 2.5 ) Pub Date : 2020-04-22 , DOI: 10.1007/s11227-020-03281-3
Reza Ramezani

SRAM-based FPGAs feature high performance and flexibility. Thus, they have found many applications in modern high-performance computing (HPC) systems. These systems suffer from the limitation of the computing resources problem for running HPC applications. Therefore, multi-FPGA systems have been emerged to alleviate such resource limitations. In this regard, efficient scheduling strategies are required to dynamically steer the execution of applications—represented as task graphs—on a set of connected FPGAs. In this paper, a heuristic-based dynamic critical path-aware scheduling technique named CPA is presented to schedule task graphs on multi-FPGA systems. The proposed technique, by considering the computation and communication capabilities of FPGAs, dynamically assigns priority to tasks in different steps in order to achieve better makespans. The proposed technique has been evaluated by conducting several experiments on real-world and three different shapes of random task graphs with different number of tasks, and its efficiency has been compared with that of three task graph scheduling approaches. The obtained results demonstrate that the proposed CPA technique outperforms well-known heuristic scheduling strategies and improves their makespan by 13.47% on average. In addition, the experiments show that the proposed technique generates the schedules in the order of milliseconds and the average of its yielded makespans is 12.05% longer than that of an optimum schedule.

中文翻译:

使用关键路径在多FPGA系统中动态调度任务图

基于 SRAM 的 FPGA 具有高性能和灵活性。因此,他们在现代高性能计算 (HPC) 系统中发现了许多应用。这些系统受到运行 HPC 应用程序的计算资源问题的限制。因此,出现了多 FPGA 系统来缓解这种资源限制。在这方面,需要有效的调度策略来动态引导应用程序的执行——用任务图表示——在一组连接的 FPGA 上。在本文中,提出了一种名为 CPA 的基于启发式的动态关键路径感知调度技术,用于在多 FPGA 系统上调度任务图。所提出的技术通过考虑 FPGA 的计算和通信能力,动态地为不同步骤中的任务分配优先级,以实现更好的完工时间。通过对现实世界和具有不同任务数量的三种不同形状的随机任务图进行多次实验,对所提出的技术进行了评估,并将其效率与三种任务图调度方法的效率进行了比较。获得的结果表明,所提出的 CPA 技术优于众所周知的启发式调度策略,并且平均提高了 13.47% 的完工时间。此外,实验表明,所提出的技术以毫秒为单位生成时间表,并且其产生的制造跨度的平均值比最佳时间表长 12.05%。并将其效率与三种任务图调度方法进行了比较。获得的结果表明,所提出的 CPA 技术优于众所周知的启发式调度策略,并且平均提高了 13.47% 的完工时间。此外,实验表明,所提出的技术以毫秒为单位生成时间表,并且其产生的制造跨度的平均值比最佳时间表长 12.05%。并将其效率与三种任务图调度方法进行了比较。获得的结果表明,所提出的 CPA 技术优于众所周知的启发式调度策略,并且平均提高了 13.47% 的完工时间。此外,实验表明,所提出的技术以毫秒为单位生成时间表,并且其产生的制造跨度的平均值比最佳时间表长 12.05%。
更新日期:2020-04-22
down
wechat
bug