arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07112cs.DC
收藏

用于比较算法组件的参数化任务图调度算法

Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components

Jared Coleman, Ravi Vivek Agrawal, Ebrahim Hirani, Bhaskar Krishnamachari

AI总结:

针对分布式计算中有向无环任务图在异构网络上的调度这一NP难问题,提出可混合搭配组件生成72种算法的通用参数化列表调度算法,通过四数据集基准测试研究组件对性能与运行时间的影响。

摘要:

将建模为有向无环任务图的分布式应用调度到异构计算网络上运行,是分布式计算中的一个基础性(NP难)问题,过去几十年里人们已经提出了许多启发式算法来解决该问题。这类算法大多属于列表调度范式,即算法首先计算任务的优先级,然后将任务贪婪地调度到能最小化某个代价函数的计算节点上。因此,许多算法之间的差异仅体现在少数关键组件上(例如任务优先级的计算方式、代价函数、算法考虑将任务插入部分完成调度的位置等)。本文提出了一种通用的参数化列表调度算法,该算法允许混合搭配不同的算法组件,可生成72种独特的算法。我们在四个数据集上对这些算法进行了基准测试,以研究不同算法组件对性能和运行时间的单独影响及组合影响。

英文摘要:

Scheduling distributed applications modeled as directed, acyclic task graphs to run on heterogeneous compute networks is a fundamental (NP-Hard) problem in distributed computing for which many heuristic algorithms have been proposed over the past decades. Many of these algorithms fall under the list-scheduling paradigm, whereby the algorithm first computes priorities for the tasks and then schedules them greedily to the compute node that minimizes some cost function. Thus, many algorithms differ from each other only in a few key components (e.g., the way they prioritize tasks, their cost functions, where the algorithms consider inserting tasks into a partially complete schedule, etc.). In this paper, we propose a generalized parametric list-scheduling algorithm that allows mixing and matching different algorithmic components to produce 72 unique algorithms. We benchmark these algorithms on four datasets to study the individual and combined effects of different algorithmic components on performance and runtime.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑