arrow
返回

Enhancing iteration performance on distributed task-based workflows

delete2023-12-01
delete0
delete
OA
AI
A
Alex Barceló *
A
Anna Queralt
T
Toni Cortés
DOI:10.1016/j.future.2023.07.032delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Task-based programming models have proven to be a robust and versatile way to approach development of applications for distributed environments. They provide natural programming patterns with high performance. However, execution on this paradigm can be very sensitive to granularity -i.e., the quantity and execution length of tasks. Granularity is often linked with the block size of the data, and finding the optimal block size has several challenges, as it requires inner knowledge of the computing environment.Our proposal is to supplement the task-based programming model with a new mechanism -our SplIter proposal. At its core, the SplIter provides a transparent way to split a collection into partitions (logical groups of blocks, obtained without any transfers nor data rearrangement), which can then be iterated. Tasks are linked to those partitions, which means that SplIter breaks the dependency between block size and task granularity.The evaluation shows that the SplIter is able to achieve performance improvements of over one order of magnitude when compared to the baseline, and it is either competitive or strictly better (depending on application characteristics) to the competitor alternative. We have chosen different applications covering a wide variety of scenarios; those applications are representatives of a broader set of applications and domains. The changes required in the source code of a task-based application are minimal, preserving the high programmability of the programming model. Two different state-of-the-art task-based frameworks have been evaluated for all the applications: COMPSs and Dask, showing that the SplIter can be effectively used within different frameworks.& COPY; 2023 Elsevier B.V. All rights reserved.
Keyword:
Task-based workflows
Distributed computing
Object store
Active storage
Dataset iteration
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

F
Future Generation Computer Systems-The International Journal of eScience
IF:
6.1
论文数:
6.9K
被引数:
2.3W

机构

U
universitat politecnica de catalunya
学者数:
1.9W
论文数: 1.6W
被引数: 17
引用论文

引用论文

PyCOMPSs: Parallel computational workflows in PythonPyCOMPSs: Python中的并行计算工作流
err2016-07-27
err90
errOAAI
errTejedor, Enric; Becerra, Yolanda; Alomar, Guillem; Queralt, Anna; Badia, Rosa M.; Torres, Jordi; Cortes, Toni; Labarta, Jesus
err分享
err收藏
err分享
err收藏
Apache Spark: A Unified Engine for Big Data ProcessingApache Spark: 用于大数据处理的统一引擎
err2016-10-28
err1.7K
PREAI
errZaharia, Matei; Xin, Reynold S.; Wendell, Patrick; Das, Tathagata; Armbrust, Michael; Dave, Ankur; Meng, Xiangrui; Rosen, Josh; Venkataraman, Shivaram; Franklin, Michael J.; Ghodsi, Ali; Gonzalez, Joseph; Shenker, Scott; Stoica, Ion
err分享
err收藏
FACTORING - A METHOD FOR SCHEDULING PARALLEL LOOPS
err1992-08-01
err223
errOAAI
errHUMMEL, SF; SCHONBERG, E; FLYNN, LE
err分享
err收藏
Dataclay: A distributed data store for effective inter-player data sharing
err2017-09-01
err22
errOAAI
errMarti, Jonathan; Queralt, Anna; Gasull, Daniel; Barcelo, Alex; Jose Costa, Juan; Cortes, Toni
err分享
err收藏
Interferometry technique for refractive index measurements at subcentimeter wavelengths
err2011-03-21
err0
PREAI
errN. A. Andrushchak; O. I. Syrotynsky; I. D. Karbovnyk; Ya. V. Bobitskii; A. S. Andrushchak; A. V. Kityk
err分享
err收藏
Task-based programming in COMPSs to converge from HPC to big data
err2017-04-06
err24
errOAAI
errConejero, Javier; Corella, Sandra; Badia, Rosa M.; Labarta, Jesus
err分享
err收藏
学者 查看更多内容