CN116610362A - Method, system, equipment and storage medium for decoding instruction set of processor - Google Patents
Method, system, equipment and storage medium for decoding instruction set of processor Download PDFInfo
- Publication number
- CN116610362A CN116610362A CN202310467460.4A CN202310467460A CN116610362A CN 116610362 A CN116610362 A CN 116610362A CN 202310467460 A CN202310467460 A CN 202310467460A CN 116610362 A CN116610362 A CN 116610362A
- Authority
- CN
- China
- Prior art keywords
- instruction
- decoding
- executed
- processor
- type
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 76
- 230000014509 gene expression Effects 0.000 claims abstract description 139
- 230000006870 function Effects 0.000 claims description 38
- 238000004590 computer program Methods 0.000 claims description 13
- 230000008569 process Effects 0.000 description 10
- 238000012545 processing Methods 0.000 description 8
- 238000006243 chemical reaction Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 238000011946 reduction process Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/30145—Instruction analysis, e.g. decoding, instruction word fields
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/30181—Instruction operation extension or modification
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Executing Machine-Instructions (AREA)
Abstract
The invention relates to the technical field of instruction decoding, and discloses a method, a system, equipment and a storage medium for decoding an instruction set of a processor, wherein the method comprises the following steps: taking out an instruction to be executed from a storage unit, and performing micro-decoding on the instruction to be executed to obtain first instruction information; judging the effectiveness of the instruction to be executed according to a preset instruction effective expression and the first instruction information, wherein the instruction effective expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm; and if the instruction to be executed is a valid instruction, executing the instruction to be executed, otherwise, discarding the instruction to be executed. The decoding method provided by the invention is simple and efficient, has higher recognition accuracy, can not only improve the running efficiency of the processor, but also characterize the performance of the processor.
Description
Technical Field
The present invention relates to the field of instruction decoding technologies, and in particular, to a method, a system, an apparatus, and a storage medium for decoding an instruction set of a processor.
Background
The instruction set is an important part of the processor architecture, and currently includes CISC (complex instruction set) represented by X86 and RISC (reduced instruction set) represented by ARM. The aim of the complex instruction set is to realize the frequently used functions with the least or even one instruction as far as possible, so that an operating circuit corresponding to the instruction is usually quite complex, and the comparison focuses on the realization of hardware functions; on the contrary, the purpose of the simplified instruction set is to decompose the complex running circuit, realize the functions by using simple multi-instruction, and reduce the complexity of hardware by software, so that the requirement of the simplified instruction set on a compiler is higher.
Because the number of instructions in the reduced instruction set is relatively small, the length of the compiled instructions is long, the memory requirement is large, and because the reduced instruction set is fixed-length, in order to facilitate the operation of most instructions among registers, a sufficient number of general registers of a CPU are needed, the complexity of addressing and the time of addressing are increased by a large register group, and the conventional decoding method of the reduced instruction set is a classified decoding method at present, but the method needs a large occupied chip area, and has great difficulty if a compiler is directly optimized. Accordingly, there is a need for further improvements and upgrades in the art.
Disclosure of Invention
In order to solve the technical problems, the invention provides a method, a system, a device and a storage medium for decoding an instruction set of a processor, so that the effectiveness of the instruction can be identified through secondary decoding before the instruction is sent to an operation unit, and the execution efficiency of the instruction is improved.
To achieve the above object, in a first aspect, the present invention provides a method for decoding an instruction set of a processor, the method comprising:
taking out an instruction to be executed from a storage unit, and performing micro-decoding on the instruction to be executed to obtain first instruction information;
judging the effectiveness of the instruction to be executed according to a preset instruction effective expression and the first instruction information, wherein the instruction effective expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm;
and if the instruction to be executed is a valid instruction, executing the instruction to be executed, otherwise, discarding the instruction to be executed.
Further, the step of decoding all instructions in the processor instruction set by the secondary decoding algorithm includes:
acquiring all instructions in an instruction set of a processor, and performing micro-decoding on all instructions to obtain instruction information of all instructions;
And decoding the instruction information of all the instructions by using a secondary decoding algorithm to obtain the instruction effective expression.
Further, the step of judging the validity of the instruction to be executed according to the preset validity condition and the first instruction information includes:
inputting the first instruction information into the instruction effective expression to obtain an output result of the instruction effective expression;
and if the output result is 1, the instruction to be executed is a valid instruction, and if the output result is 0, the instruction to be executed is an invalid instruction.
Further, the step of the secondary decoding algorithm includes:
obtaining data to be decoded, and generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
Further, after the executing the instruction to be executed, the method further includes:
and identifying the type of the instruction to be executed according to a preset type effective expression set and the first instruction information to obtain the instruction type of the instruction to be executed, wherein the type effective expression set is obtained by respectively decoding the instructions of different types in the instruction set of the processor through the secondary decoding algorithm.
Further, the step of decoding the different types of instructions in the processor instruction set by the secondary decoding algorithm includes:
acquiring all instructions in a processor data set, and classifying all instructions according to instruction types to obtain a plurality of sub-instruction sets;
respectively carrying out micro decoding on the instructions in each sub-instruction set to obtain instruction information corresponding to each sub-instruction set;
and decoding the instruction information corresponding to each sub instruction set by using the secondary decoding algorithm to obtain type effective expressions corresponding to each instruction type, and forming type effective expression sets by all the type effective expressions.
Further, the step of identifying the type of the instruction to be executed according to the preset type effective expression set and the first instruction information to obtain the instruction type of the instruction to be executed includes:
Respectively inputting the first instruction information into each type effective expression of the type effective expression set to obtain an output result of each type effective expression;
combining output results of the type effective expressions according to preset rules to generate instruction type codes;
and obtaining the instruction type of the instruction to be executed according to the instruction type code.
In a second aspect, the present invention provides a processor instruction set decoding system, the system comprising:
the instruction fetching decoding module is used for fetching an instruction to be executed from the storage unit, and performing micro decoding on the instruction to be executed to obtain first instruction information;
the validity judging module is used for judging the validity of the instruction to be executed according to a preset instruction valid expression and the first instruction information, wherein the instruction valid expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm;
and the instruction execution module is used for executing the instruction to be executed if the instruction to be executed is a valid instruction, otherwise, discarding the instruction to be executed.
Further, the system further comprises:
The instruction effective expression generating module is used for acquiring all instructions in the instruction set of the processor, and performing micro decoding on all instructions to obtain instruction information of all instructions; and decoding the instruction information by using a secondary decoding algorithm to obtain an instruction effective expression.
Further, the system further comprises:
the secondary decoding module is used for obtaining data to be decoded, generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
In a third aspect, embodiments of the present invention further provide a computer device, including a memory, a processor, and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the above method when executing the computer program.
In a fourth aspect, embodiments of the present invention also provide a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the above method.
The invention provides a method, a system, a computer device and a storage medium for decoding an instruction set of a processor. The method can identify whether the instruction is effective or not through the effective expression when the instruction is sent to the operation unit, is simple and efficient, has accurate judging result, and can improve the execution efficiency of the system instruction.
Drawings
FIG. 1 is a flow chart of a method for decoding an instruction set of a processor according to an embodiment of the invention;
FIG. 2 is a flow chart of another method for decoding an instruction set of a processor according to an embodiment of the present invention;
FIG. 3 is a flow chart of a third method for decoding an instruction set of a processor according to an embodiment of the present invention;
FIG. 4 is a block diagram of a system for decoding instruction sets of a processor according to an embodiment of the present invention;
Fig. 5 is an internal structural view of a computer device in an embodiment of the present invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The instruction set is a set of instructions in the CPU for computing and controlling the computer system, which is an important component of the processor system architecture, and can be divided into a complex instruction set and a reduced instruction set according to the mainstream architecture of the present stage. The instruction set relates to the performance exertion of the CPU and is an important mark for the performance exertion of the CPU.
For instruction execution by a CPU, modern processors are widely used with five-stage pipelines, namely fetch, decode, execute, memory access, and write back. Before the instruction execution process is described, the encoding of the instruction is explained, and the encoding refers to the process of realizing the process from assembly language to binary machine code, and is specifically characterized in that the instruction is firstly divided into operation codes and operands, the operation codes represent instruction functions, such as addition, subtraction, multiplication, division and the like, the operands represent input and output corresponding to the instruction functions, and the input and the output are also represented in a circuit.
Fetch refers to the CPU fetching an instruction from the corresponding address of the memory according to the current PC (Program Counter), i.e., program counter value. The decoding decodes the fetched instruction machine code to select the corresponding circuit to execute the fetched instruction, such as selecting the adder circuit or the logic NOT circuit, and executing the instruction. The decoding corresponds to the encoding of the instruction, and the encoding refers to the process of realizing the assembly language to the binary machine code, and is specifically characterized in that the instruction is firstly divided into an operation code and an operand, the operation code represents instruction functions such as addition, subtraction, multiplication, division and the like, the operand represents input and output corresponding to the instruction functions, and the input and the output are also represented in a circuit.
Taking a processor based on the POWER architecture as an example, the instruction codes in the POWER architecture are 32 bits, so that many functions (operation codes) and registers (operands) can be supported and expressed. When the instruction is about to be executed to the decoding stage, the instruction is micro-decoded according to the original machine code before decoding, a pile of instruction data is split first, what instruction is the first instruction is judged, what instruction is the second instruction, a classification mark is possibly carried out on the instruction, and the micro-decoded instruction is placed in an instruction queue. In the decode stage, the register file is read based on the just-obtained result to obtain the source operand of the instruction. When the CPU encounters an instruction like adding two numbers in the memory, it needs to be decomposed into: loading a first number from memory; loading a second number from the memory; two numbers add up such three instructions. In general, an original instruction is called a macro operation, and a resolved instruction is called a micro operation. The present method for classifying and decoding instructions has the disadvantage of large occupied chip area, and therefore, the present invention provides a method for performing secondary decoding based on micro decoding to solve the problems of the existing classified and decoding method.
Referring to fig. 1, a method for decoding an instruction set of a processor according to a first embodiment of the present invention includes steps S10 to S30:
step S10, an instruction to be executed is taken out from a storage unit, and micro decoding is carried out on the instruction to be executed to obtain first instruction information.
The CPU can acquire the instruction and micro-decode operation before executing the instruction, so as to obtain the first instruction information corresponding to the instruction to be executed, and the instruction can execute the execution stage after decoding in the conventional instruction execution process.
And step S20, judging the effectiveness of the instruction to be executed according to a preset instruction effective expression and the first instruction information, wherein the instruction effective expression is obtained by decoding all instructions in an instruction set of a processor through a secondary decoding algorithm.
In order to verify the validity of all instructions in a system architecture in a unified manner, therefore, the unified processing needs to be performed on all instructions, but the unified processing is performed on the instructions by a secondary decoding method, and the specific steps are as follows:
Acquiring all instructions in an instruction set of a processor, and performing micro-decoding on all instructions to obtain instruction information of all instructions;
and decoding the instruction information of all the instructions by using a secondary decoding algorithm to obtain the instruction effective expression.
Referring to fig. 2, taking the POWER architecture as an example, all instructions of the POWER architecture are first obtained, and unified micro-decoding operation is performed on all instructions, which is a function of the existing CPU, so that no excessive description is made. After the machine codes of all instructions are subjected to specific processing, the instruction information of all the processed instructions is obtained, and in order to identify the effectiveness of each instruction subsequently, the instruction information of all the instructions is required to be subjected to unified secondary decoding to generate instruction effective expressions suitable for all the instructions, so that the effectiveness of all the instructions is judged, and the effectiveness of all the instructions can be judged through one instruction effective expression, and the effectiveness judgment efficiency is improved.
Since there are many instructions, the instruction information obtained after the processing may have a bit width of several tens of bits, and thus the data bit width processed by the secondary decoding is relatively large. The conventionally used method for reducing the carnot map is generally only used for data bit width of about 4 bits, and cannot be applied to data with larger bit width, so that the method introduces a quinine-maclaky algorithm to provide algorithm support for secondary decoding of large bit width instruction information, and although the quinine-maclaky algorithm is functionally equivalent to the carnot map and is a method for minimizing a boolean function, in the prior art, no method for performing secondary decoding on instructions is adopted, and no precedent for applying the quinine-maclaky algorithm to reducing instruction information is adopted. The invention innovatively uses the quinine-maclaky algorithm as a secondary decoding algorithm to perform secondary decoding on the instruction information so as to realize rapid and effective processing on the instruction information of all instructions, and the specific steps are as follows:
Obtaining data to be decoded, and generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
The core of the secondary decoding algorithm is to find out the essential element implication items of the function by finding all the element implication items of the function and using the element implication items, so that a final simplification result is obtained. The steps can be divided into two steps:
(1) Find the element implication item. If there are two terms that differ in only one binary value, the number of bits can be represented by a horizontal line to indicate that the number is negligible. This process is repeated continuously, and when no more two items can be found, only one binary value is different, the remaining items are called prime implication items.
(2) Finding the intrinsic element. All items in (1) are represented by finding the least-significant-implication item, and the resulting item is referred to as an intrinsic-significant implication item. All the essence implications are combined together to obtain the final simplification result.
Taking data with a bit width of 4 bits as an example, a simplification process of the secondary decoding algorithm is described below by a specific example, and by correlation between instruction information, it is assumed that the following four-variable logic function expression is obtained:
F(a,b,c,d)＝∑m(0,1,5,6,8,9,10,14)
the logic function expression in this embodiment is expressed in a standard form of the sum of the min terms, so the above-described four-variable logic function expression is written in a form of the sum of the min terms of all four variables that make the function value 1, that is, m (0), m (1), m (5), m (6), m (8), m (9), m (10), and m (14) are the min terms, and a, b, c, and d are the input logic variables.
First, the groups are grouped by the number of "1" s in the min term, resulting in different groups, as shown in table 1 below:
table 1 min term grouping table
Next, the two smallest items that can be merged in table 1 are merged to obtain an implication item (implantant) of size 2. The merging may mean that if only one bit in the binary representation of the smallest term in two different groupings is different, the two smallest terms may be merged, and during the merging, for the different bits of the two smallest terms, a horizontal line may be used to replace the bit to indicate that the bit is negligible. The results are shown in Table 2 below:
TABLE 2 min term merge table
Then, according to the same merging principle, the implication items with the size of 2 in table 2 are continuously merged to obtain the implication items with the size of 4, and meanwhile, the implication items which can not be continuously merged are marked with a sign of prime implication item (prime im), as shown in the following table 3:
table 3 implication item merger table
Since the merging result of m (0, 1) and m (8, 9) is m (0,1,8,9) as the merging result of m (0, 8) and m (1, 9), only one implication item with the size of 4 is obtained after merging the implication items with the size of 2, and the implication items which cannot be merged any more are the prime implication items.
Through the steps, all the essence implication items are obtained, and an essence implication item table can be constructed in the next step, as shown in the following table 4:
table 4 essential element implication item table
In the above table "×" is added to the prime implication term (essential prime implicant), which indicates that the term cannot be combined with other implication terms, and m (8, 10) can be covered by m (0,1,8,9) and m (10, 14), and m (10, 14) can be covered by m (8, 10) and m (6, 14), so that neither m (8, 10) nor m (10, 14) is an prime implication term, and m (8, 10) nor m (10, 14) cannot be represented by prime implication terms m (0,1,8,9), m (1, 5), and m (6, 14), so that in the actual reduction process, m (8, 10) and m (10, 14) can be arbitrarily selected to use a final expression, for example, m (8, 10) is selected, and the final reduced logical expression is:
If there is no item or several items cannot be represented by any combination of the essence implication items, the final reduction result is a logical OR of all the essence implication items.
The effective instruction expression can be obtained by uniformly processing a large amount of instruction information carrying multi-bit data through a secondary decoding algorithm, and the instruction can be correctly identified through the effective instruction expression, and the specific steps are as follows:
inputting the first instruction information into the instruction effective expression to obtain an output result of the instruction effective expression;
and if the output result is 1, the instruction to be executed is a valid instruction, and if the output result is 0, the instruction to be executed is an invalid instruction.
For different instruction information entering the operation unit, if the effective instruction expression is enabled to be 1, the instruction is considered to be effective, if the output value of the effective instruction expression is 0, the instruction is considered to be ineffective, that is, a simplified logic function expression is obtained through a secondary decoding algorithm, and the simplified logic function expression is taken as the effective instruction expression, so that the effectiveness judgment of all instruction codes through one expression can be realized.
Step S30, if the instruction to be executed is a valid instruction, executing the instruction to be executed, otherwise discarding the instruction to be executed.
The instruction identified as valid may be subjected to the next instruction operation, and the instruction determined as invalid may be discarded. The secondary decoding algorithm provided by the invention can simply and accurately identify the effectiveness of the instruction to be executed by using the unified instruction effective expression, and the system occupation during the operation of the ineffective instruction can be avoided through the effective identification, so that the decoding method provided by the invention not only can improve the efficiency of the instruction executed by the system, but also can improve the safety and stability of the operation of the system.
Furthermore, the secondary decoding algorithm provided by the invention can be combined with other instruction information to represent more specific information of the instruction, such as the operation type, data type and the like of the executed instruction can be obtained after the instruction is executed. The method comprises the following steps:
and identifying the type of the instruction to be executed according to a preset type effective expression set and the first instruction information to obtain the instruction type of the instruction to be executed, wherein the type effective expression set is obtained by respectively decoding the instructions of different types in the instruction set of the processor through the secondary decoding algorithm.
The invention can also display the specific information of the instruction by combining the secondary decoding with other instructions, so that a user can understand the executed instruction in more detail, and the running state of the processor can be further judged by the specific information of the executed instruction.
Referring to fig. 3, based on the same principle as the instruction validity expression generation, the operation type and the data type of the instruction can be identified by the type expression mode, the type expression can also be generated based on the secondary decoding algorithm, and the specific steps of generating the type expression are as follows:
acquiring all instructions in a processor data set, and classifying all instructions according to instruction types to obtain a plurality of sub-instruction sets;
respectively carrying out micro decoding on the instructions in each sub-instruction set to obtain instruction information corresponding to each sub-instruction set;
and decoding the instruction information corresponding to each sub instruction set by using the secondary decoding algorithm to obtain type effective expressions corresponding to each instruction type, and forming type effective expression sets by all the type effective expressions.
The complexity of the instruction in the instruction set of the processor according to the operation type can be divided into simple operation and complex operation, such as data conversion, bit taking, addition, subtraction and multiplication in four operations and mixed operation thereof belong to simple operation, and division and square root operation can be classified into complex operation due to the processing of iteration and the like; the data types of the instruction can be divided into floating point operation, fixed point operation, vector operation and scalar operation, and under the POWER architecture, the data can be further divided into floating point binary operation, floating point decimal operation and the like.
According to the classification rules described above, or any other classification rules, all instructions in the processor instruction set may be type-classified, i.e. all instructions are divided into several instruction sets of different types. Taking the operation type as an example, assuming that the instructions are divided into four types of conversion bit taking, independent addition and subtraction multiplication, mixed addition and subtraction multiplication and division square root according to the operation type, all instructions in the instruction set of the processor can be divided into four sub instruction sets with different operation types according to the classification rules.
The method comprises the steps of carrying out micro decoding on sub instruction sets respectively to obtain instruction information corresponding to each sub instruction set, then carrying out decoding on the instruction information corresponding to each sub instruction set respectively according to the secondary decoding algorithm to obtain type effective expressions corresponding to each operation type, and assuming that the type effective expressions corresponding to the four operation types are a first type effective expression, a second type effective expression, a third type effective expression and a fourth type effective expression respectively, the four expressions can form a type effective expression set, and identification of operation types of instructions can be realized through the type effective expression set, so that the instruction types of executed instructions, such as operation types, data types and the like, are accurately known.
Since the effective expression is not the only one used at this stage, the operation type cannot be identified simply by using the output result of the expression as 0 and 1, and for this purpose, the invention also provides an instruction type encoding method for identifying the instruction type by combining the effective expression set of the type, and the specific steps of type identification are as follows:
respectively inputting the first instruction information into each type effective expression of the type effective expression set to obtain an output result of each type effective expression;
combining output results of the type effective expressions according to preset rules to generate instruction type codes;
and obtaining the instruction type of the instruction to be executed according to the instruction type code.
In the step of recognizing the validity of the instruction, we have obtained the instruction information of the instruction by the micro-decoding of the CPU, and in the case where the instruction is recognized as being effectively executed by the instruction, the instruction information of the instruction may be input into each type valid expression in the type valid expression set generated by the above step, that is, the input type valid expression set, thereby obtaining the output result of each type valid expression.
For the output result, there may be various encoding modes, for example, the output result is encoded according to the binary digits, and it is assumed that the conversion bits, the single addition and subtraction multiplication, the mixed addition and subtraction multiplication, and the division square root correspond to the lowest bit to the highest bit of the binary respectively, that is, if the instruction is identified as the mixed addition and subtraction multiplication operation, the output result of the type effective expression corresponding to the type is 1, the output results of other expressions are all zero, at this time, the type of the finally output instruction is encoded as 0100, the conversion is 4, and in the preset rule, 4 is represented as the mixed operation instruction; if the type of instruction output is 0001, namely, decimal 1, it can be known that the instruction performs a conversion fetching operation, while binary 0010, namely, decimal 2, indicates that the instruction performs a separate add-subtract multiplication operation, and binary 1000, namely, decimal 8, indicates that the instruction performs a relatively complex division root operation. In addition, the invention also provides another instruction type coding method, namely, different instruction types are represented by different numerical values, and the four types of conversion bits, independent addition and subtraction multiplication, mixed addition and subtraction multiplication and division square root are respectively represented by 0, 1, 2 and 3, and then the corresponding numerical values are output according to the type of the expression with the output result of 1. For example, when the output result of the fourth type effective expression corresponding to the division square root operation is 1, the output instruction type code is 3, that is, the division square root operation is executed on behalf of the instruction. Of course, other coding modes may be used to represent the corresponding types, and the coding rules provided in this embodiment are only preferred rules, and may be flexibly set according to the situation in actual use, which is not limited in this case too.
The data type identification can also be performed by classifying, micro-decoding and secondary decoding all instructions according to the steps to generate corresponding type valid expressions, so that the data type of the instructions can be identified, and the output instruction type codes can be encoded together with the operation types, or can be encoded independently. For example, the binary bit number and the operation type can be encoded together, the fifth bit from the lower bit to the higher bit is assumed to represent fixed point operation, the sixth bit represents floating point operation, if the output instruction type is 00011000, the instruction can be known to execute division root operation of fixed point data according to the bit number of 1; if encoded separately, 4 may be used to represent a fixed point operation, 5 may be used to represent a floating point operation, etc. The specific content of the effective instruction execution, such as what type of data is executed, can be clearly known through the output instruction type coding, and the specific information of the executed instruction can be rapidly and effectively displayed through the instruction type coding. With the rapid development of computers and integrated circuits, the requirements on the performance of microprocessor floating point algorithms are higher and higher, and a floating point arithmetic unit (FPU) becomes an important index for measuring the performance of the CPU. The division and square root algorithm is a relatively complex algorithm in a floating point arithmetic unit (FPU), and is also an algorithm with a large number of loops, so that the division and square root algorithm is an important aspect affecting the performance of the FPU. Based on the situation, the invention also provides a method for judging and characterizing the performance of the processor, namely, the specific information of the instruction is accurately acquired through the instruction type identification, and the running performance of the CPU is further characterized according to the specific information of the instruction.
The instruction type code of the invention is output together with the output result of execution after the instruction execution is completed, namely the instruction type code is correspondingly output besides the output result after the instruction execution is completed, whether the instruction executes the division square root operation of floating point data can be obtained from the instruction type code, different CPU (Central processing Unit) of the processor can run the same series of instructions, the execution times of the division square root operation of the floating point data in unit time are counted according to the output instruction type code, the performance of the processor is judged according to the execution times of the division square root operation of the floating point data in unit time, and obviously, compared with the processor with less execution times, the performance of the processor with more execution times is better.
Furthermore, the performance of different processors can be finely graded by designing different execution times in unit time, and the performance of the processors can be characterized in detail and accurately, so that a certain data support is provided for the subsequent process of improving the performance of the processors. It should be noted that, under the condition that the instruction has a plurality of decoding information, the decoding method provided by the present invention may still be used, for example, two decoding methods may be used for the instruction after micro-decoding, one decoding method is used for identifying the type of the instruction, and the other decoding method may be used for the secondary decoding of some or all of the instruction information, so as to accurately identify the instruction.
Further, the present application provides another preferred embodiment, in which, after obtaining the instruction information of the instruction to be executed, the judgment of the instruction validity and the identification of the instruction classification are performed simultaneously, that is, in the actual logic design, the instruction validity and the instruction type can be combined according to the design requirement, and only if the instruction belongs to a certain type and simultaneously satisfies the instruction validity expression, the instruction is actually valid, and the instruction is executed. For example, it is known that an instruction to be executed is a division operation, and when the instruction is designed, the requirement that only the instruction of the division operation can be executed is required to be met, then the instruction can be judged by combining the effective judgment of the instruction with the identification of the instruction classification, and only if the instruction meets the condition that the effective expression of the instruction is 1 and the type codes corresponding to the division operation are consistent, the instruction can be executed really effectively, so that the specific requirement of the instruction execution can be met, and the accuracy of the instruction execution can be further ensured. It should be noted that, without departing from the technical principles of the present application regarding effective instruction determination and instruction classification recognition, the secondary decoding method provided by the present application may be applied to various stages in the instruction execution process according to actual situations, and related methods should also fall within the protection scope of the present application.
The method for decoding the instruction set of the processor provided by the embodiment can identify the effectiveness of the instruction before the instruction is sent to the operation unit for execution by carrying out unified secondary decoding on the instruction information on the basis of the conventional micro decoding of the processor, and can be matched with other instruction information to represent specific information of the instruction.
Referring to fig. 4, a decoding system for instruction set of a processor according to a second embodiment of the present invention includes:
the instruction fetching and decoding module 10 is used for fetching an instruction to be executed from the storage unit, and performing micro decoding on the instruction to be executed to obtain first instruction information;
the validity judging module 20 is configured to judge the validity of the instruction to be executed according to a preset instruction validity expression and the first instruction information, where the instruction validity expression is obtained by decoding all instructions in the processor instruction set through a secondary decoding algorithm;
The instruction execution module 30 is configured to execute the instruction to be executed if the instruction to be executed is a valid instruction, and otherwise discard the instruction to be executed.
The secondary decoding algorithm provided by the invention can simply and accurately identify the effectiveness of the instruction to be executed by using the unified instruction effective expression, so that the efficiency of executing the instruction by the system is improved, and the safety and stability of the system operation are also improved.
Further, in a preferred embodiment, the system further comprises:
the instruction effective expression generating module is used for acquiring all instructions in the instruction set of the processor, and performing micro decoding on all instructions to obtain instruction information of all instructions; and decoding the instruction information by using a secondary decoding algorithm to obtain an instruction effective expression.
In order to realize unified judgment of all instructions, unified decoding is needed to be carried out on instruction information of all instructions to generate instruction effective expressions applicable to all instructions, and judgment of effectiveness of all instructions can be realized through one instruction effective expression, so that efficiency of effectiveness judgment is improved.
Further, in a preferred embodiment, the system further comprises:
the secondary decoding module is used for obtaining data to be decoded, generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
The method innovatively uses the quinine-maclaky algorithm as a secondary decoding algorithm to perform secondary decoding on the instruction information, and can rapidly and effectively process data with larger bit width. Therefore, the simplified logic function expression is obtained, and the validity of all instructions can be judged by taking the simplified logic function expression as the instruction validity expression, so that the method is simple, and the method has extremely high judging efficiency and judging accuracy.
Further, in a preferred embodiment, the system further comprises:
The instruction type identification module is used for identifying the type of the instruction to be executed according to a preset type effective expression set and the first instruction information to obtain the instruction type of the instruction to be executed, and the type effective expression set is obtained by respectively decoding the instructions of different types in the instruction set of the processor through the secondary decoding algorithm.
The secondary decoding algorithm provided by the invention can be combined with other instruction information to represent more specific information of the instruction, so that a user can understand the executed instruction in more detail, and the running state of the processor can be further judged through the specific information of the executed instruction.
Further, in a preferred embodiment, the system further comprises:
the instruction classification module is used for acquiring all instructions in the processor data set, classifying all instructions according to instruction types and obtaining a plurality of sub instruction sets;
the instruction set micro-decoding module is used for respectively carrying out micro-decoding on the instructions in each sub-instruction set to obtain instruction information corresponding to each sub-instruction set;
and the type effective expression generating module is used for decoding the instruction information corresponding to each sub instruction set by using the secondary decoding algorithm to obtain type effective expressions corresponding to each instruction type, and forming a type effective expression set by all the type effective expressions.
The method for generating the effective expression is simple and efficient, and the accuracy of identification is high.
Further, in a preferred embodiment, the system further comprises:
respectively inputting the first instruction information into each type effective expression of the type effective expression set to obtain an output result of each type effective expression;
combining output results of the type effective expressions according to preset rules to generate instruction type codes;
and obtaining the instruction type of the instruction to be executed according to the instruction type code.
The method can rapidly and effectively display the specific information of the executed instruction in the instruction type coding mode, and the coding method is simple and effective, occupies less resources and does not influence the operation efficiency of the system.
The technical features and technical effects of the instruction set decoding system of a processor provided in the embodiment of the present invention are the same as those of the method provided in the embodiment of the present invention, and are not described herein. Each of the above modules in a processor instruction set decoding system may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
Referring to FIG. 5, in one embodiment, an internal architecture diagram of a computer device, which may be a terminal or a server in particular. The computer device includes a processor, a memory, a network interface, a display, and an input device connected by a system bus. Wherein the processor of the computer device is configured to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The network interface of the computer device is used for communicating with an external terminal through a network connection. The computer program is executed by a processor to implement a method of decoding a set of instructions for the processor. The display screen of the computer equipment can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer equipment can be a touch layer covered on the display screen, can also be keys, a track ball or a touch pad arranged on the shell of the computer equipment, and can also be an external keyboard, a touch pad or a mouse and the like.
It will be appreciated by those of ordinary skill in the art that the architecture shown in fig. 5 is merely a block diagram of some of the structures associated with the present inventive arrangements and is not limiting of the computer devices to which the present inventive arrangements may be applied, and that a particular computing device may include more or fewer components than those shown in the way, or may combine certain components, or have the same arrangement of components.
In addition, the embodiment of the application also provides computer equipment, which comprises a memory, a processor and a computer program stored on the memory and capable of running on the processor, wherein the processor realizes the steps of the method when executing the computer program.
Furthermore, the embodiment of the application also provides a computer readable storage medium, on which a computer program is stored, which when being executed by a processor, implements the steps of the method.
In summary, the embodiment of the application provides a method, a system, a device and a storage medium for decoding an instruction set of a processor, wherein the method obtains first instruction information by fetching an instruction to be executed from a storage unit and performing micro decoding on the instruction to be executed; judging the effectiveness of the instruction to be executed according to a preset instruction effective expression and the first instruction information, wherein the instruction effective expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm; and if the instruction to be executed is a valid instruction, executing the instruction to be executed, otherwise, discarding the instruction to be executed. The decoding method provided by the application is simple and efficient, has higher identification accuracy, can not only improve the running efficiency of the processor, but also characterize the performance of the processor.
In this specification, each embodiment is described in a progressive manner, and all the embodiments are directly the same or similar parts referring to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments. It should be noted that, any combination of the technical features of the foregoing embodiments may be used, and for brevity, all of the possible combinations of the technical features of the foregoing embodiments are not described, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples represent only a few preferred embodiments of the present application, which are described in more detail and are not to be construed as limiting the scope of the application. It should be noted that modifications and substitutions can be made by those skilled in the art without departing from the technical principles of the present application, and such modifications and substitutions should also be considered to be within the scope of the present application. Therefore, the protection scope of the patent of the application is subject to the protection scope of the claims.
Claims (12)
1. A method of decoding a processor instruction set, comprising:
taking out an instruction to be executed from a storage unit, and performing micro-decoding on the instruction to be executed to obtain first instruction information;
judging the effectiveness of the instruction to be executed according to a preset instruction effective expression and the first instruction information, wherein the instruction effective expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm;
and if the instruction to be executed is a valid instruction, executing the instruction to be executed, otherwise, discarding the instruction to be executed.
2. The method of claim 1, wherein the step of decoding all instructions in the processor instruction set by a quadratic decoding algorithm comprises:
acquiring all instructions in an instruction set of a processor, and performing micro-decoding on all instructions to obtain instruction information of all instructions;
and decoding the instruction information of all the instructions by using a secondary decoding algorithm to obtain the instruction effective expression.
3. The method according to claim 2, wherein the step of determining the validity of the instruction to be executed according to a preset validity condition and the first instruction information includes:
Inputting the first instruction information into the instruction effective expression to obtain an output result of the instruction effective expression;
and if the output result is 1, the instruction to be executed is a valid instruction, and if the output result is 0, the instruction to be executed is an invalid instruction.
4. The method of claim 2, wherein the step of the secondary decoding algorithm comprises:
obtaining data to be decoded, and generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
5. The method of claim 2, further comprising, after said executing said instruction to be executed,:
and identifying the type of the instruction to be executed according to a preset type effective expression set and the first instruction information to obtain the instruction type of the instruction to be executed, wherein the type effective expression set is obtained by respectively decoding the instructions of different types in the instruction set of the processor through the secondary decoding algorithm.
6. The method of claim 5, wherein the step of decoding the different types of instructions in the processor instruction set by the secondary decoding algorithm comprises:
acquiring all instructions in a processor data set, and classifying all instructions according to instruction types to obtain a plurality of sub-instruction sets;
respectively carrying out micro decoding on the instructions in each sub-instruction set to obtain instruction information corresponding to each sub-instruction set;
and decoding the instruction information corresponding to each sub instruction set by using the secondary decoding algorithm to obtain type effective expressions corresponding to each instruction type, and forming type effective expression sets by all the type effective expressions.
7. The method of claim 6, wherein the step of identifying the type of the instruction to be executed according to a preset type valid expression set and the first instruction information to obtain the instruction type of the instruction to be executed includes:
respectively inputting the first instruction information into each type effective expression of the type effective expression set to obtain an output result of each type effective expression;
Combining output results of the type effective expressions according to preset rules to generate instruction type codes;
and obtaining the instruction type of the instruction to be executed according to the instruction type code.
8. A processor instruction set decoding system, the system comprising:
the instruction fetching decoding module is used for fetching an instruction to be executed from the storage unit, and performing micro decoding on the instruction to be executed to obtain first instruction information;
the validity judging module is used for judging the validity of the instruction to be executed according to a preset instruction valid expression and the first instruction information, wherein the instruction valid expression is obtained by decoding all instructions in a processor instruction set through a secondary decoding algorithm;
and the instruction execution module is used for executing the instruction to be executed if the instruction to be executed is a valid instruction, otherwise, discarding the instruction to be executed.
9. The processor instruction set decoding system of claim 8, wherein said system further comprises:
the instruction effective expression generating module is used for acquiring all instructions in the instruction set of the processor, and performing micro decoding on all instructions to obtain instruction information of all instructions; and decoding the instruction information by using a secondary decoding algorithm to obtain an instruction effective expression.
10. The processor instruction set decoding system of claim 9, wherein said system further comprises:
the secondary decoding module is used for obtaining data to be decoded, generating a logic function expression according to a logic relationship between the data to be decoded, wherein the data to be decoded is instruction information obtained by micro-decoding an instruction in an instruction set of a processor;
iteratively merging the minimum term in the logic function expression to generate a prime inclusion term, and selecting a prime inclusion term from the prime inclusion terms;
and combining the essence implication items and/or the essence implication items according to a minimum coverage principle to obtain a simplified logic function expression.
11. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any one of claims 1 to 7 when the computer program is executed by the processor.
12. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310467460.4A CN116610362B (en) | 2023-04-27 | 2023-04-27 | Method, system, equipment and storage medium for decoding instruction set of processor |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310467460.4A CN116610362B (en) | 2023-04-27 | 2023-04-27 | Method, system, equipment and storage medium for decoding instruction set of processor |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116610362A true CN116610362A (en) | 2023-08-18 |
| CN116610362B CN116610362B (en) | 2024-02-23 |
Family
ID=87684503
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310467460.4A Active CN116610362B (en) | 2023-04-27 | 2023-04-27 | Method, system, equipment and storage medium for decoding instruction set of processor |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116610362B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118626151A (en) * | 2024-08-14 | 2024-09-10 | 北京开源芯片研究院 | Instruction stream file generation method and device, electronic equipment and readable medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131807A1 (en) * | 2008-11-26 | 2010-05-27 | I-Shou University | Decoding algorithm for quadratic residue codes |
| US20170123793A1 (en) * | 2015-11-03 | 2017-05-04 | Intel Corporation | Enabling removal and reconstruction of flag operations in a processor |
| CN108920788A (en) * | 2018-06-20 | 2018-11-30 | 华中科技大学 | Based on insubstantial volume, decoding circuit, crossed array circuit and its operating method for containing logic of memristor |
| US20190034108A1 (en) * | 2015-08-19 | 2019-01-31 | Spatial Digital Systems, Inc. | Private access to media data on network storage |
| CN111345004A (en) * | 2017-11-09 | 2020-06-26 | 区块链控股有限公司 | System for simplifying executable instructions to optimize verifiable computing |
| EP3716049A1 (en) * | 2019-03-29 | 2020-09-30 | Intel Corporation | Apparatuses, methods, and systems for hashing instructions |
| CN112771550A (en) * | 2018-09-06 | 2021-05-07 | 奥普塔姆软件股份有限公司 | Automatic generation of efficient rule set implementations |
| CN113157636A (en) * | 2021-04-01 | 2021-07-23 | 西安邮电大学 | Coprocessor, near data processing device and method |
| CN113608491A (en) * | 2021-07-16 | 2021-11-05 | 广东财经大学 | Method for compiling delayed logic schematic diagram into byte code |
| CN113612581A (en) * | 2021-08-03 | 2021-11-05 | 浙江极传信息技术有限公司 | Universal LDPC decoding method and system with high throughput rate |
| CN114430280A (en) * | 2020-10-29 | 2022-05-03 | 华为技术有限公司 | Decoding method and device |
| CN114675890A (en) * | 2022-05-26 | 2022-06-28 | 飞腾信息技术有限公司 | Instruction execution method, device, equipment and storage medium |
| CN115630595A (en) * | 2022-10-25 | 2023-01-20 | 展讯通信(天津)有限公司 | Automatic logic circuit generation method and device, electronic device and storage medium |
-
2023
- 2023-04-27 CN CN202310467460.4A patent/CN116610362B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100131807A1 (en) * | 2008-11-26 | 2010-05-27 | I-Shou University | Decoding algorithm for quadratic residue codes |
| US20190034108A1 (en) * | 2015-08-19 | 2019-01-31 | Spatial Digital Systems, Inc. | Private access to media data on network storage |
| US20170123793A1 (en) * | 2015-11-03 | 2017-05-04 | Intel Corporation | Enabling removal and reconstruction of flag operations in a processor |
| CN111345004A (en) * | 2017-11-09 | 2020-06-26 | 区块链控股有限公司 | System for simplifying executable instructions to optimize verifiable computing |
| CN108920788A (en) * | 2018-06-20 | 2018-11-30 | 华中科技大学 | Based on insubstantial volume, decoding circuit, crossed array circuit and its operating method for containing logic of memristor |
| CN112771550A (en) * | 2018-09-06 | 2021-05-07 | 奥普塔姆软件股份有限公司 | Automatic generation of efficient rule set implementations |
| EP3716049A1 (en) * | 2019-03-29 | 2020-09-30 | Intel Corporation | Apparatuses, methods, and systems for hashing instructions |
| CN114430280A (en) * | 2020-10-29 | 2022-05-03 | 华为技术有限公司 | Decoding method and device |
| CN113157636A (en) * | 2021-04-01 | 2021-07-23 | 西安邮电大学 | Coprocessor, near data processing device and method |
| CN113608491A (en) * | 2021-07-16 | 2021-11-05 | 广东财经大学 | Method for compiling delayed logic schematic diagram into byte code |
| CN113612581A (en) * | 2021-08-03 | 2021-11-05 | 浙江极传信息技术有限公司 | Universal LDPC decoding method and system with high throughput rate |
| CN114675890A (en) * | 2022-05-26 | 2022-06-28 | 飞腾信息技术有限公司 | Instruction execution method, device, equipment and storage medium |
| CN115630595A (en) * | 2022-10-25 | 2023-01-20 | 展讯通信(天津)有限公司 | Automatic logic circuit generation method and device, electronic device and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 张骏;樊晓桠;张萌;: "并行CISC指令译码器的设计与实现", 计算机应用研究, no. 11, pages 200 - 202 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118626151A (en) * | 2024-08-14 | 2024-09-10 | 北京开源芯片研究院 | Instruction stream file generation method and device, electronic equipment and readable medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116610362B (en) | 2024-02-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20160321039A1 (en) | Technology mapping onto code fragments | |
| KR20090050977A (en) | System, method, and computer program product for performing a scan operation on a sequence of single-bit values using a parallel processor architecture | |
| CN117193861B (en) | Instruction processing method, apparatus, computer device and storage medium | |
| Zoni et al. | An FPU design template to optimize the accuracy-efficiency-area trade-off | |
| CN112256330A (en) | RISC-V instruction set extension method for accelerating digital signal processing | |
| Lakshminarayana et al. | Incorporating speculative execution into scheduling of control-flow-intensive designs | |
| US20100037039A1 (en) | Instruction operation code generation system | |
| CN116610362B (en) | Method, system, equipment and storage medium for decoding instruction set of processor | |
| JP5936135B2 (en) | Information processing apparatus, information processing method, and program | |
| CN115469931B (en) | Instruction optimization method, device, system, equipment and medium of loop program | |
| Citron et al. | Hardware memoization of mathematical and trigonometric functions | |
| TWI786879B (en) | Method and system for execution of a conditional statement by an arithmetic and/or bitwise unit | |
| Fornaciari et al. | Hardware and software support for mixed precision computing: a roadmap for embedded and hpc systems | |
| Ghandour et al. | The potential of using dynamic information flow analysis in data value prediction | |
| Caska et al. | Java dust: How small can embedded Java be? | |
| US20170185409A1 (en) | Hardware accuracy counters for application precision and quality feedback | |
| Radaideh et al. | Exploiting zero data to reduce register file and execution unit dynamic power consumption in GPGPUs | |
| CN115951936B (en) | Chip adaptation method, device, equipment and medium of vectorization compiler | |
| CN112130899A (en) | Stack computer | |
| Rupnow et al. | Scientific application demands on a reconfigurable functional unit interface | |
| US20240303041A1 (en) | Apparatus and method for energy-efficient and accelerated processing of an arithmetic operation | |
| Kwak et al. | High-performance embedded branch predictor by combining branch direction history and global branch history | |
| Burger | burger | |
| Najjar et al. | Pipeline Hazards Resolution for a New Programmable Instruction Set RISC Processor | |
| Fryza et al. | Instruction-level programming approach for very long instruction word digital signal processors |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |