computer organization

最新推荐文章于 2023-12-30 10:04:42 发布

dayancn

最新推荐文章于 2023-12-30 10:04:42 发布

阅读量952

点赞数

分类专栏： MIPS

MIPS 专栏收录该内容

13 篇文章 0 订阅

订阅专栏

http://www.cs.umd.edu/class/sum2003/cmsc311/Notes/

There are two sets of notes, so far. They're the only ones withlinks, so click on them. The others are titles of notes I planto write over time. You can look for similar topics in the book.

How to "Build" a Computer
Some condensed notes on building a computer.

Errata

Here is the list of errata.

Course Philosophy

Why learn computer organization? (forthcoming)
How this course is being organized (forthcoming)

Being a Better Student

Active learning in the classroom (3/12/03)
How to read a book (4/05/03)
The "web" and geek web sites (3/16/03)
Thoughts on Programming (3/16/03)
Virtual Bookshelf: What's onYour Shelf? (3/16/03)
Student Manifesto: What I'm Owed (4/05/03)
Big Ideas in Computer ScienceNEW (6/18/03)
Teaching and Learning: Explaining To Yourself
Attention to Detail

Baby Computer Organization

Quick overview of a computer systemREVISED (6/24/03)(6/9/03)
Abstaction and Computer Organization (forthcoming)
What's a Wire (6/9/03)
What's a Bus? (3/17/03) (6/9/03)
What's a Clock? (4/12/03)
What's a Register? (4/12/03)
What's a Tri-State Buffer?NEW (7/1/03)
Black Boxes
Simple Model of Memory (3/30/03)
What's in Your CPU? (forthcoming)
What's an ISA? (3/17/03)
Quick overview of MIPS architecture (forthcoming)
A Toy MIPS program (forthcoming)
Fetch, Execute, DecodeUPDATED, 6 steps (7/1/03) (3/16/03)

Baby Combinational Circuits

Overview of Baby Combinational Circuits
Baby MUX
Baby DeMUX
Baby Encoder
Baby Decoder

Building a Computer

Fetch, Execute, Decode in Detail (forthcoming)
Register File as a Black BoxNEW (7/1/03)
Implementing a Register FileNEW (7/2/03)
ALU (4/05/03)
Executing R-type instructions (forthcoming)
Executing I-type instructions (forthcoming)
Executing J-type instructions (forthcoming)
Control Units (forthcoming)

Combinational Logic

(6/17/03) I changed the notation for negationfrom x' to \x. This was done because ' (prime) ishard to read, and backslash is easier to see.

Boolean Functions/Truth TablesREVISED (6/17/03) (3/24/03)
Basic Logic GatesCLEANED UP (6/17/03) (3/24/03)
Implementing Boolean FunctionsREVISED (6/28/03) (3/26/03)
Functional Completeness (3/27/03)
Black Boxes (4/11/03)
Multiplexers/Demultiplexers (4/19/03)
Half Adders/Full Adders/Ripple Carry Adders (4/12/03)
MUX trick: Implemeting Truth Tables (4/19/03)
ROM trick: Implemeting Truth Tables with Multiple Outputs (4/19/03)
Overflow Detection for Adders (4/19/03)
Fast Addition: Carry Lookahead Adders (4/21/03)
Implementing a 1-bit ALU (4/19/03)
Encoders/Decoders (4/20/03)REVISED (6/28/03)
Decoder/Encoder Trick: Implementing Permutations, etc. (4/21/03)
MUX Case Studies
- Case Study: Implementing a 5-1 MUXNEW (6/28/03)
- Case Study: Implementing a 8-1 MUXNEW (6/28/03)
- Thoughts on Learning By ExampleNEW (6/28/03)
Summary of Output Equations for Common Combinational Logic CircuitsNEW (6/28/03)
Shifters/Circular Shifters (forthcoming)
Programmable Logic Array (PLA) (5/17/03)

Sequential Logic

What is State? (4/22/03)
Difference between Combinational and Sequential Logic (4/22/03)
Introduction to Flip Flops: D and T (4/30/03)
Parallel Load Registers (4/30/03)
Asynchronous Counters (5/1/03)
Finite State Machines with Output (Mealy and Moore Machines) (5/4/03)
Excitation Tables for D and T Flip FlopsNEW (6/28/03)
Implementing Mealy and Moore MachinesREVISED (6/28/03) (6/26/03)
Why Finite State Machines?
Case Study: Three State Synchronous CountersNEW (6/27/03)
Equivalence of D and T flip flopsNEW (6/27/03)

Memory

Interleaved Memory (5/16/03)
Cache
- Page and Offset (forthcoming)
- Introduction to CachesUPDATED (7/7/03)(5/16/03)
- Fully Associative CachesUPDATED (7/8/03)(5/16/03)
- Direct Mapped Caches (5/16/03)
- Set Associative Caches (5/16/03)
- Avoiding Pitfall: Addresses vs. SlotsNEW (7/6/03)
Direct Memory Access (DMA) (5/16/03)
Virtual MemoryNEW (7/6/03)

I/O

Memory Mapped I/ONEW (7/6/03)
External InterruptsNEW (7/6/03)
PollingNEW (7/6/03)

Putting It All Together

dayancn

关注

0
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
computer organization

http://www.cs.umd.edu/class/sum2003/cmsc311/Notes/There are two sets of notes, so far. They're the only ones withlinks, so click on them. The others are titles of notes I planto write over time. Y
复制链接

扫一扫