Efficient grouping-based mapping and scheduling on heterogeneous cluster architectures |
| |
| Authors: | Qunyan Sun Qingfeng Zhuge Jingtong Hu Juan Yi Edwin H.-M. Sha |
| |
| Affiliation: | 1. College of Information Science and Engineering, Hunan University, Changsha, Hunan 410082, China;2. College of Computer Science, Chongqing University, Chongqing 400044, China;3. School of Electrical and Computer Engineering, Oklahoma State University, Stillwater, OK 74078, USA;4. Department of Computer Science, University of Texas at Dallas, Richardson, TX 75080, USA;5. Key Laboratory of Dependable Service Computing in Cyber Physical Society, Ministry of Education, Chongqing 400044, China |
| |
| Abstract: | Heterogeneous clusters of computers usually provide high computing power for large-scale applications at the expense of large cost. And there are two challenges currently faced by researchers. One is how to map large applications, modeled by Directed Acyclic Graphs (DAG), to heterogeneous architectures with minimal cost. The other is how to schedule tasks on each cluster to further decrease the total cost. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
