Patent ReferencesData processor with future file with parallel update and method of operation Apparatus for providing memory and register operands concurrently to functional units Superscalar processor with parallel issue and execution device having forward map of operand and instruction dependencies Special purpose processor for digital audio/video decoding Method and apparatus for performing register hazard detection Processor containing data path units with forwarding paths between two data path units and a unique configuration or register blocks Method and apparatus for performing latency based hazard detection Pre-arbitrated bypasssing in a speculative execution microprocessor Processor with improved history file mechanism for restoring processor state after an exception Microprocessor with conditional cross path stall to minimize CPU cycle time length Patent #: 6766440 InventorsAssigneeApplicationNo. 10074098 filed on 02/11/2002US Classes:712/218, Commitment control or register bypass712/217, Scoreboarding, reservation station, or aliasing711/214, Operand address generation712/23, Superscalar712/36, Application specific712/214INSTRUCTION ISSUINGExaminersPrimary: Coleman, EricInternational ClassG06F009/312AbstractThe invention provides a processor architecture that bypasses data hazards. The architecture has an array of pipelines and a register file. Each of the pipelines includes an array of execution units. The register file has a first section of n registers (e.g., 128 registers) and a second section of m registers (e.g., 16 registers). A write mux couples speculative data from the execution units to the second set of m registers and non-speculative data from a write-back stage of the execution units to the first section of n registers. A read mux couples the speculative data from the second set of m registers to the execution units to bypass data hazards within the execution units. The register file preferably includes column decode logic for each of the registers in the second section of m registers to architect speculative data without moving data. The decode logic first decodes, and then selects, an age of the producer of the speculative state; the newest producer enables the decode.Field of SearchCommitment control or register bypass | |