计算机科学
工作流程
有向无环图
任务(项目管理)
地铁列车时刻表
分布式计算
继任枢机主教
并行计算
资源(消歧)
理论计算机科学
数据库
算法
操作系统
计算机网络
经济
数学分析
管理
数学
作者
Svetlana Kulagina,Henning Meyerhenke,Anne Benoît
出处
期刊:International Conference on Parallel Processing
[Institute of Electrical and Electronics Engineers]
日期:2024-08-08
卷期号:: 305-316
被引量:7
标识
DOI:10.1145/3673038.3673068
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI