-
公开(公告)号:US07062762B2
公开(公告)日:2006-06-13
申请号:US10317475
申请日:2002-12-12
CPC分类号: G06F9/3891 , G06F8/447
摘要: The present invention provides methods specifically geared to finding natural splits in wide, nearly symmetric dependence graphs and assigning the components of the split to clusters in a VLIW processor. The basic approach of these methods is to assign a node n of the dependence graph to the cluster to which it has the strongest affinity. A node n has the strongest affinity to the cluster containing its closest common ancestor node. Then, the mirror image node or nodes of the node n are located if they are present in the graph and are assigned to other clusters in the processor to which they have the strongest affinity.