Parallel task distribution strategy in 3D mesh based on multilevel k-way partitioning
Sun Xiao-peng · Jisuanji gongcheng yu sheji · 2010
To resolve the problem of large communication cost created from task distribution by using traditional partitioning method in 3D mesh parallel computing,a parallel task distribution strategy based on multilevel K-way partitioning algorithm is presented.Firstly,partitioned 3D mesh by using multilevel K-way partitioning algorithm,treating task partitioning as graph partitioning,and then took a task mapping parallel algorithm to map computing task on every computing node.Finally,some experiments of computing shortest path problem in 3D mesh are done on ShenTeng 1800 clusters,the results indicate that compared with traditional row-column task mapping strategy,this strategy effectively reduce communication cost and ensure load balance at the same time,running time decrease and speedup increase.