Computer Architecture

0.0(0)
Studied by 0 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/11

flashcard set

Earn XP

Description and Tags

I hate ts

Last updated 3:29 AM on 8/5/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

12 Terms

1
New cards

Pipeline depth tradeoffs?

More depth means more throughput but results in more stalls if hazard

2
New cards

Structural hazards

multiple inst need the same hardware resource at the same time

3
New cards

Data hazard

an inst needs a result that hasn’t been written back

4
New cards

Control hazard

doesn’t know if a branch will get taken or not

5
New cards

What does a BTB do

Stores target jump addy of a previous branch

6
New cards

BTB vs branch predictor

branch predictor - do I take it or not
BTB - where do I jump if take

7
New cards

Direct-mapped cache and pros/cons

Each addy maps to exactly one cache location

Pro: fast lookup

Con: thrashing

8
New cards

n-way set-associative cache

each addy has n spots it can map to

Pro: reduce thrashing

Con: complex

9
New cards

Full-associative cache

can go anywhere
Pro: no thrashing
Con: expensive, slow to search

10
New cards

Compulsory miss

first accessCap

11
New cards

Capacity

cache too small

12
New cards

Conflict

multiple addy mapping to the same space despite free space elsewhere