Skip to content
This repository has been archived by the owner on Oct 13, 2020. It is now read-only.
/ Tomasulo Public archive

Introduction in Dynamic Instruction Scheduling (Advanced Computer Architecture) implementing Tomasulo's Algorithm

License

Notifications You must be signed in to change notification settings

CSpyridakis/Tomasulo

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

61 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Tomasulo MIT license Size

Introduction in Dynamic Instruction Scheduling (Advanced Computer Architecture). This project is an educational proof of concept implementation of Tomasulo's Algorithm with following specifications:

Top Module

5 x Reservation Stations:

  • 3 of them are for arithmetic operations
  • 2 of them are for logic operations

2 x Functional Units (one for each operation type):

  • Arithmetic FU is a 3 stage pipeline unit
  • Logic FU is a 2 stage pipeline unit

Register File:

  • 32 x 32bits Registers for Data
  • 32 x 5bits Registers for Tags

Common Data Bus

  • Broadcasts data from FU to RS and ROB

Issue Unit (acceptable operations):

  • add/addi
  • sub/subi
  • sll
  • and/andi
  • or/ori
  • not

Reorder Buffer:

  • 30 x Available Slots

Documentation

Reports

If you want more information about each module you could read (or just try to read, unfortunately at this point are only in greek language) the following report files:

Diagrams

Block and timing diagrams are able to be changed:

Usage

Enviroment

This project was developed using Xilinx ISE 14.7

Import and Run

In order to import project and run simulations:

  1. Create a new project

  2. Right click on your Project

  3. Select "Add copy of source"

  4. Select all source files

  5. If you want to run my test code import all test files and open simulation files

(Simulation screenshots are included here)