Assignment-2-ACA

19. Explain the dynamic scheduling of a pipeline using Tomasulo’s algorithm.

Tomasulo's algorithm

There are 3 Methods for scheduling Instruction through pipeline .

1. Static scheduling
2. Dynamic scheduling-
3. Score Boarding

Tomasulo's algorithm for dynamic instructions scheduling

Tomasulo's algorithm is a computer architecture hardware algorithm for dynamic scheduling

of instructions that allows out-of-order execution and enables more efficient use of multiple
execution units. This scheme resolved resource conflicts ,data dependencies using register
tagging to allocate or deallocate the source and destination registers

This algorithm was applied to work with processors having a few floating point registers. The
figure shows a minimum register machine code for computing X=Y+Z and A=B X C with
pipeline timing. Here the total execution time is 13 cycles, counting from cycle 4 to 15 by
ignoring the stratup.

Figure :Dynamic Instruction scheduling using Tomasulo’s Algorithm

Memory is treated as a special functional unit . when an instruction has completed execution,
the result appears on the result bus , The registers and RSs (reservation station), Monitor the
result bus and update their contents when matching tag is found.