previous
 next 
CS 3853 Computer Architecture Notes on Chapter 3 Section 5


Today's News: November 21, 2012
No news

Read Section 3.5

3.5: Dynamic Scheduling Algorithm

Tomasulo Algorithm Details

The 7 fields of a reservation station:
Today's News: November 26, 2012
Here is the form we filled in last time.

Figure 3.7 (empty) shows a blank form that can be filled in.
Figure 3.7 (filled) shows the result filled with the second load instruction waiting for memory.
Figure 3.7 (completed) shows the result filled after cycle 13 (with additional values in parentheses).

Today's News: November 28, 2012
Exam 3 on Friday

A Loop Example

Consider the unrolled (but unscheduled) loop from November 12.
This has 4 iterations of the loop and takes 27 cycles.
How would this do under Tomasulo's algorithm?
Tomasulo Loop Form(empty) shows a blank form that can be filled in.
Here is an HTML version.
Assumptions: Here is a completed solution.
The unscheduled unrolled loop took 27 cycles.
The scheduled unrolled loop took 14 cycles.
What advantage does the tomasulo algorithm have over the scheduled unrolled loop?

Tomasulo Algorithm Summary


Next Notes

Back to CS 3853 Notes Table of Contents