.png){kind=icon}
.png){kind=icon}
Return
Interconnection Network Energy-Aware Workflow Scheduling Algorithm on Heterogeneous Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2019.2962531.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Heterogeneous systems based on multicore (CPU) and manycore (GPU) processors have been regarded as an important computing infrastructure in recent years. Large-scale computationally intensive scientific workflow applications have recently been deployed on such systems. However, improving the system performance and reducing the energy consumption under user deadline constraints remain challenging problems. In this article, we first investigate the computing node network energy consumption problem of fat-tree interconnection networks for a low communication-to-computation ratio workflow application. We then propose a heuristic list-based network energy-efficient workflow scheduling (NEEWS) algorithm including top-level task computing, task subdeadline initialization, a dynamic adjustment, and an edge data optimization communication method. Extensive simulations were conducted based on randomly generated workflow applications and two real-world scientific applications. The experiment results clearly demonstrate that our proposed workflow scheduling strategy outperforms three other algorithms in terms of energy consumption. In particular, NEEWS is extremely suitable owing to its high parallelism and low communication in large-scale scientific applications.
Keywords:
Task analysis
Energy consumption
Multiprocessor interconnection
Scheduling algorithms
Scheduling
Multicore processing
Energy consumption
heterogeneous systems
scientific workflow
task scheduling
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.9
Papers:
8.3K
Citations:
6.0W