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.

 
Web www.patentalert.com

< Protected mutual authentication over an unsecured wireless communication channel

< Television control interface with electronic guide

> Dynamic arrays and overlays with bounds policies

> Method for utilizing resource characterizations to optimize performance in an electronic device

~ 00268