Abstract: Heterogeneous computing is a novel trend of high-performance technology．Mismatch between parallel tasks and architecture leads to realize high performance hardly．Reconfiguration technique brings an opportunity for it．In order to realize their matching,this paper provided similarity-driven reconfigurable algorithm．Firstly the paper gave definitions of graph-similarity and graph-reconfiguration．Secondly through building a measurement between task graph and fixed architecture,the paper provided a graph-reconfiguration problem and a similarity-driven reconfigurable algorithm．The algorithm includes three processes:nodes-fused,node_edge_reconfiguration and node_edge_refined．Finally the paper gave a test on Greenwich benchmark with the typical architecture．The results show that the algorithm can realize the optimal match between the parallel tasks and the architectures on heterogeneous computing.

Key words: Parallel task graph,Architecture,Heterogeneous computing,Similarity-driven,Reconfiguration