.png){kind=icon}
.png){kind=icon}
Return
GCSS: a global collaborative scheduling strategy for wide-area high-performance computing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-021-0353-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Wide-area high-performance computing is widely used for large-scale parallel computing applications owing to its high computing and storage resources. However, the geographical distribution of computing and storage resources makes efficient task distribution and data placement more challenging. To achieve a higher system performance, this study proposes a two-level global collaborative scheduling strategy for wide-area high-performance computing environments. The collaborative scheduling strategy integrates lightweight solution selection, redundant data placement and task stealing mechanisms, optimizing task distribution and data placement to achieve efficient computing in wide-area environments. The experimental results indicate that compared with the state-of-the-art collaborative scheduling algorithm HPS+, the proposed scheduling strategy reduces the makespan by 23.24%, improves computing and storage resource utilization by 8.28% and 21.73% respectively, and achieves similar global data migration costs.
Keywords:
high-performance computing
scheduling strategy
task scheduling
data placement
Journal
IF:
4.6
Papers:
1.6K
Citations:
2.8K