.png){kind=icon}
返回
Scalable linear programming based resource allocation for makespan minimization in heterogeneous computing systems
.png){kind=icon}
OA
AI
DOI：10.1016/j.jpdc.2015.07.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Resource management for large-scale high performance computing systems poses difficult challenges to system administrators. The extreme scale of these modern systems require task scheduling algorithms that are capable of handling at least millions of tasks and thousands of machines. Highly scalable algorithms are necessary to efficiently schedule tasks to maintain the highest level of performance from the system. In this study, we design a novel linear programming based resource allocation algorithm for heterogeneous computing systems to efficiently compute high quality solutions for minimizing makespan. The novel algorithm tightly bounds the optimal makespan from below with an infeasible schedule and from above with a fully feasible schedule. The new algorithms are highly scalable in terms of solution quality and computation time as the problem size increases because they leverage similarity in tasks and machines. This novel algorithm is compared to existing algorithms via simulation on a few example systems. (C) 2015 Elsevier Inc. All rights reserved.
Keyword:
High performance computing
Scheduling
Resource management
Bag-of-tasks
Heterogeneous computing
Linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
分享收藏Performance-effective and low-complexity task scheduling for heterogeneous computing面向异构计算的高性能低复杂度任务调度
PREAI
分享收藏
查看更多内容