System and method of populating an instruction word

A method for populating an instruction word for simultaneous execution of instruction operations by a plurality of ALUs in a data path, the method comprising:

• creating a dependency graph of instruction nodes, each instruction node including at least one instruction operation;
• initially designating any of the instruction nodes in the dependency graph as global, wherein a global designation represents at least that the corresponding instruction node is expected to require inputs from outside of a predefined limited physical range of ALUs, the range being smaller than the full extent of the data path;
• and
• first selecting a first available instruction node from the dependency graph;
• first assigning the selected first available instruction node to the instruction word;
• second selecting any available dependent instruction nodes that are dependent upon a result of the selected first available instruction node and do not violate any predetermined rule, the any predetermined rule includes that the instruction word may not include an available dependent instruction node that is designated as global;
• second assigning to the instruction word the selected any available dependent instruction nodes;
• and
• updating the dependency graph to remove any instruction nodes assigned during the first and second assigning from further consideration for assignment.

A non-transitory computer readable media storing instructions for populating instruction words for simultaneous execution of instruction operations by a plurality of ALUs in a data path, which when executed by a system, cause the system to perform operations comprising:

• creating a dependency graph of instruction nodes, each instruction node including at least one instruction operation;
• initially designating any of the instruction nodes in the dependency graph as global, wherein a global designation represents at least that the corresponding instruction node is expected to require inputs from outside of a predefined limited physical range of ALUs, the range being smaller than the full extent of the data path;
• and
• first selecting a first available instruction node from the dependency graph;
• first assigning the selected first available instruction node to the instruction word;
• second selecting any available dependent instruction nodes that are dependent upon a result of the selected first available instruction node and do not violate any predetermined rule, the any predetermined rule includes that the instruction word may not include an available dependent instruction node that is designated as global;
• second assigning to the instruction word the selected any available dependent instruction nodes;
• and
• updating the dependency graph to remove any instruction nodes assigned during the first and second assigning from further consideration for assignment.