Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Dynamic Scheduling-Advance Computer Architecture-Lecture Slides, Slides of Advanced Computer Architecture

This course focuses on quantitative principle of computer design, instruction set architectures, datapath and control, memory hierarchy design, main memory, cache, hard drives, multiprocessor architectures, storage and I/O systems, computer clusters. This lecture includes: Dynamic, Scheduling, Tomasulo, Function, Register, Scoreboard, Flags, Operation, Destination

Typology: Slides

2011/2012

Uploaded on 08/06/2012

amrusha
amrusha 🇮🇳

4.4

(32)

149 documents

1 / 78

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Today's Topics
Recap - Lecture 13
Dynamic Scheduling
Tomasulo’s Approach
Summary
docsity.com
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d
pf3e
pf3f
pf40
pf41
pf42
pf43
pf44
pf45
pf46
pf47
pf48
pf49
pf4a
pf4b
pf4c
pf4d
pf4e

Partial preview of the text

Download Dynamic Scheduling-Advance Computer Architecture-Lecture Slides and more Slides Advanced Computer Architecture in PDF only on Docsity!

Today's Topics

Recap - Lecture 13 Dynamic Scheduling Tomasulo’s Approach Summary

Recap: Summary

Instruction Level Parallelism in Hardware or Software SW parallelism dependencies defined by program result in hazards if HW cannot resolve HW exploiting ILP works when dependence cannot be determined at run time

Recap …..Cont’d

Scoreboard …. Cont’d– Structural and data dependencies are checked at ID stage It facilitates out-of-order execution which results in out- of-order completion

Recap …..Cont’d

Recap …..Cont’d

Recap …..Cont’d

Recap …..Cont’d

Today's Topics

Recap - Lecture 13 Tomasulo’s Approach Scoreboard Vs. Tomasulo’s Approach Summary

Tomasulo's Algorithm Vs. Scoreboard Differences between IBM 360 & CDC 6600 ISA is:

- IBM has only 2 register specifiers / instr vs. 3 in CDC 6600 - IBM has 4 FP registers vs. 8 in CDC 6600

Tomasulo's Organization For Dynamic Scheduling

Components of Tomasulo's Structure Load Buffers have three functions:

  • Hold components of effective address until it is computed
  • Track outstanding Loads waiting on memory
  • Hold the result of completed load waiting for CDB

Components of Tomasulo's Structure Store Buffers also have three functions:

  • Hold components of effective address until it is computed
  • Hold the destination memory address of outstanding store instructions
  • Hold the address and value of store until the memory unit is available

Sequence of operations All the results from the FP units or the Load unit are placed on the Common Data Bus, which goes to the FP register file as well as to the RS and store buffers

Tomasulo's Algorithm Vs. Scoreboard Control & buffers distributed with Function Units (FU) in Tomasulo vs. centralized in scoreboard

- FU buffers called ―reservation stations‖; have pending operands