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

将受内存约束的大规模工作流映射到异构平台

Mapping Large Memory-constrained Workflows onto Heterogeneous Platforms

Svetlana Kulagina, Henning Meyerhenke, Anne Benoit

AI总结:

针对大规模DAG型科学工作流的内存约束调度问题,提出一种四步启发式算法,通过DAG分块、块拆分合并适配内存及块交换局部搜索,在异构平台上实现更优的完工时间表现。

摘要:

科学工作流通常以有向无环图(DAG)表示,其中顶点对应任务,边表示任务间的依赖关系。由于这类图在任务数量和资源需求两方面通常都规模庞大,因此在并行或分布式计算系统上对其进行高效调度至关重要。通常情况下,每个任务的执行都需要一定量的内存,且需要向其后续任务传递数据。因此,研究目标是在满足内存约束的前提下,尽可能快地执行工作流(即最小化其完工时间makespan)。为此,我们研究了DAG型工作流在异构平台上的划分与映射问题,这类平台中每个处理器的运算速度和内存容量均可不同。我们首先在现有内存感知解决方案缺失的情况下,提出了一种基线算法。作为核心贡献,我们随后提出了一种四步启发式算法。其第一步是利用现有的DAG划分器,将输入DAG划分为更小的块。接下来的两步通过进一步拆分和合并这些块,调整DAG的所得块以适配处理器内存,并针对整体完工时间进行优化。最后,我们通过块交换的局部搜索方法进一步优化完工时间。我们在包含多达30000个任务的真实工作流和模拟工作流上开展了实验评估,结果表明,与忽略异构性的基线算法相比,利用该四步启发式算法挖掘异构性可使完工时间平均降低2.44倍(在大规模工作流上效果更显著)。

英文摘要:

Scientific workflows are often represented as directed acyclic graphs (DAGs), where vertices correspond to tasks and edges represent the dependencies between them. Since these graphs are often large in both the number of tasks and their resource requirements, it is important to schedule them efficiently on parallel or distributed compute systems. Typically, each task requires a certain amount of memory to be executed and needs to communicate data to its successor tasks. The goal is thus to execute the workflow as fast as possible (i.e., to minimize its makespan) while satisfying the memory constraints. Hence, we investigate the partitioning and mapping of DAG-shaped workflows onto heterogeneous platforms where each processor can have a different speed and a different memory size. We first propose a baseline algorithm in the absence of existing memory-aware solutions. As our main contribution, we then present a four-step heuristic. Its first step is to partition the input DAG into smaller blocks with an existing DAG partitioner. The next two steps adapt the resulting blocks of the DAG to fit the processor memories and optimize for the overall makespan by further splitting and merging these blocks. Finally, we use local search via block swaps to further improve the makespan. Our experimental evaluation on real-world and simulated workflows with up to 30,000 tasks shows that exploiting the heterogeneity with the four-step heuristic reduces the makespan by a factor of 2.44 on average (even more on large workflows), compared to the baseline that ignores heterogeneity.

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

↑