Dynamic Scheduling Approach - The Tomasulo Algorithm


The basic structure of a DLX FP unit using Tomasulo's algorithm
Floating-point operations are sent from the instruction unit into a queue (called the FLOS, or floating-point operation stack, in the IBM 360/91) when they are issued. The reservation stations include the operation and the actual operands, as well as information used for detecting and resolving hazards. There are load buffers to hold the results of outstanding loads and store buffers to hold the addresses of outstanding stores waiting for their operands. All results from either the FP units or the load unit are put on the common data bus(CDB), which goes to the FP register file as well as the reservation stations and store buffers. The FP adders implement addition and subtraction, while the FP multipliers do multiplication and division. The concept of tomasulo's algorithm is like the concept of data flow computer


Problem Set

This page is created by Yueh-Lin Liu(yueh@cs.bu.edu) as a part of Master project under the supervision of Prof. Azer Bestavros(best@cs.bu.edu)
Created: 1995.5.1
Updated: 1995.5.10