| 异构计算中体系结构感知的并行任务分簇方法 |
| |
| 引用本文： | 郝水侠,曾国荪.异构计算中体系结构感知的并行任务分簇方法[J].计算机科学,2013,40(3):121-125. |
| |
| 作者姓名： | 郝水侠 曾国荪 |
| |
| 作者单位： | (同济大学计算机科学与技术系 上海 201804) (江苏师范大学数学科学学院 徐州 221116) |
| |
| 摘 要： | 异构计算是高效能计算发展的必然趋势，针对异构计算运行中并行任务和体系结构难匹配的问题，提出了实
现并行任务和体系结构匹配的并行任务分簇方法。首先给出效能的概念及异构计算中体系结构感知的分簇问题，然
后从理论上分析了异构匹配与效能的关系，提出了实现异构计算匹配和结构匹配的分簇理论，目的是发挥异构计算中
机器的潜能，协同处理并行任务，实现高效能。在此基础上，给出相应的算法。最后通过仿真实验说明，该方法可通过
簇图与体系结构的匹配缩短通信开销在执行时间上所占的比例，从而缩短并行执行时间，以提高系统利用率，最终实
现异构计算的高效能。
|
| 关 键 词： | 异构计算，并行任务匹配，体系结构感知，分簇 |
Architecture-aware Parallel Task Clustering Policy in Heterogeneous Computing |
| |
| Abstract: | Heterogeneous computing has been a trend of high-productivity computing. Matching between parallel task
and architecture in heterogeneous computing becomes a key idea to realize high productivity. We provided parallel task
clustering policy based on matching between parallel task and architecture. Firstly we gave the concept of high-produc-
tivity and the problem of clustering on heterogeneous computing. Secondly after theoretically analyzing the relation be-
tween heterogeneous matching and productivity, we gave the method of realizing respectively computing and structure
matching. hhirdly we gave accordingly the architecturcaware parallel task clustering algorithm. Finally the simulation
experimental results show that such algorithms can effectively realize heterogeneous matching and enhance the hetero-
gcncous computing productivity. |
| |
| Keywords: | Heterogeneous computing Parallel task matching Architecturcaware Clustering |
|
|
点击此处可从《计算机科学》下载全文 |
