System for obtaining parallel execution of existing instructions in a particulr data processing configuration by compounding rules based on instruction categories

Claim 1

A computer implemented system for processing a sequence of existing binary encoded scalar instructions stored in a data storage unit, each instruction including an operation code, prior to fetching said sequence for execution in a data processing system that is capable of parallel instruction execution but places constraints on said parallel instruction execution, comprising in combination: an instruction compounding unit; means for transferring said sequence of binary encoded scalar instructions from said data storage unit to said instruction compounding unit; said instruction compounding unit assigning each operation code in said sequence of instructions to one of a plurality of categories based on a function performed by said data processing system in response to said operation code, the number of said categories being less than the number of operation codes in said sequence of instructions; said instruction compounding unit storing data that encodes those instruction pairs in said sequence of instructions that are compoundable based on the category assigned to the operation code of each adjacent instruction of said instruction pairs; said instruction compounding unit processing groups of instructions to generate a compounding instruction for instruction pairs by comparing in a relational matrix a category assigned respectively to each instruction of the instruction pairs in said group of instructions.