• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊
论文

A Practical Automatic Code Partitioning Algorithm

Expand
  • (School of Computer Science,National University of Defense Technology,Changsha 410073,China)

Received date: 2008-12-15

  Revised date: 2009-04-20

  Online published: 2010-11-25

Abstract

Automatically partitioning the code in compilers and applying the code overlay technique is one of the key techniques for exploiting the performance of processors with small memory capacity. With the occuring of heterogeneous multicore processors, such a kind of processor usually acts as a synergistic processing unit. The paper presents a practical automatic code partitioning algorithm and implements it by the GNU tool chain for the Cell processors. It finds the hot points in call graphs according to the calling frequency, and then adopts a simplified clustering method to perform hotpointdirected partition clustering. Finally, it performs capacitydirected partition merging. The experimental results show that the algorithm can work perfectly with lower complexity.

Cite this article

YANG Canqun, LI Chunjiang,WANG Feng . A Practical Automatic Code Partitioning Algorithm[J]. Computer Engineering & Science, 2010 , 32(11) : 132 -135 . DOI: 10.3969/j.issn.1007130X.2010.

Outlines

/