Explicit instruction scheduler state information for the processor
A technology for state information and instruction scheduling, applied in concurrent instruction execution, electrical digital data processing, instrumentation, etc., and can solve problems such as low performance
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0012] Examples described in this disclosure relate to instruction set architectures (ISAs) and processors that may have instructions organized in groups, such as blocks of instructions, that are fetched, executed, and committed atomically. Thus, a processor can centrally fetch instructions belonging to a single group, map them to execution resources within the processor, execute the instructions, and atomically commit their results. The processor can either commit the results of all instructions, or cancel the execution of the entire group. Instructions within a group can be executed in order of data flow. Additionally, a processor may allow instructions within a group to communicate directly with each other. An instruction that produces a result may, instead of writing the result to a register file, pass the result to another instruction that consumes the result. For example, an instruction to add the values stored in registers R1 and R2 can be expressed as shown in Tabl...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


