Repeated ALU in pipelined processor design

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

395325, 395800, G06F 1300

Patent

active

053332849

ABSTRACT:
A six-stage pipeline processor comprised of the sequential stages: instruction fetch; instruction decode; first full ALU; second full ALU; Fill Register; and Write Back Register. Memory addresses are calculated in the first ALU stage and this stage presents the address along with a read command to memory at the end of the cycle. Two cycles are allowed for a data response from memory but only one intervening instruction is required to occupy the pipeline for most instruction sequences because bypass logic makes available data operands from memory at the second ALU stage with an apparent load latency of one cycle. Subtraction and other arithmetic operations are performed in the first ALU if the result is to be used by a subsequent LOAD instruction to calculate a memory address so that the result can be used by the first ALU to calculate the memory address without any intervening instruction and potential loss of overall performance.

REFERENCES:
patent: 4613935 (1986-09-01), Couleur
patent: 4725973 (1988-02-01), Matsuura et al.
patent: 4783783 (1988-11-01), Nagai et al.
patent: 4819155 (1989-04-01), Wulf et al.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Repeated ALU in pipelined processor design does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Repeated ALU in pipelined processor design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Repeated ALU in pipelined processor design will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-1057894

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.