Abstract: To cope with the problem of reconfigurable hardware task partitioning under area constraints,this paper presents a Communication-cost and Hardware-fragment Utilization Cluster Partitioning(CHUCP) algorithm.According to the idea of cluster based partitioning(CBP) algorithm,the nodes from the ready queue to be scheduled are partitioned sequentially to the current modules under the constraints of a hardware area.In the process of partitionings,the nodes,which do not meet the requirements,are overlooked,and the nodes,which do not increase in the number of edges between the two partitionings,are found and partitioned to the current partitionings.As a node is partitioned,the indegrees of its successors will be updated.If the indegrees of its successors are zero and meet the requirements,its successors will be partitioned;if the indegrees of its successors are not zero,its precursors will be examined dynamically.The areas of its precursors meet the specified thresholds,then its successors and precursors will be partitioned to the current modules.In order to adjust dynamically the lists of node scheduling order,the response ratio function is constructed with the guideline of making good use of the node weights,the dependence between two nodes,the priority of low level nodes,etc.In comparison with cluster based partitioning(CBP) and level sensitive cluster based partitioning(LSCBP) algorithm,the experimental results show that,the proposed algorithm can get better improvements in times of non-input and non-output,the number of modules.As for decreasing the communication cost of modules,the proposed algorithm has rationality and feasibility.