Scribd
Upload
169 views20 pages

CDA3101 L01 Introduction MSS

This document provides an overview of a computer organization course. It introduces the course topics, textbook, and administration details. The key topics covered include computer abstraction levels, computer anatomy, performance issues, instruction set architectures, and parallelism concepts like pipelining and multiprocessing.

Uploaded by

Rosemond Fabien
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
169 views20 pages

CDA3101 L01 Introduction MSS

This document provides an overview of a computer organization course. It introduces the course topics, textbook, and administration details. The key topics covered include computer abstraction levels, computer anatomy, performance issues, instruction set architectures, and parallelism concepts like pipelining and multiprocessing.

Uploaded by

Rosemond Fabien
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 20

CDA 3101 Spring 2016

Introduction to Computer Organization

Introduction

Tue 05 Jan 2016


Mark Schmalz

http://www.cise.ufl.edu/~mssz/CompOrg/Top-Level.html
Overview
• Introduction to CDA 3101
• Course overview
• Housekeeping details
• Computer abstraction
• Anatomy of a computer
• Conclusion
Introduction
• Rapidly changing field:
– vacuum tube -> transistor -> IC -> VLSI (see Section 1 of text)
– doubling every 1.5 years (Moore’s law):
• Memory capacity
• Processor speed (Due to advances in technology and organization)
• Things you’ll be learning:
– how computers work, a basic foundation
– how to analyze their performance (or how not to!)
– issues affecting modern processors (caches, pipelines)
• Why learn this stuff?
– you want to call yourself a “computer scientist”
– you want to build software people use (need performance)
– you need to make a purchasing decision or offer advice
Computing System

Application (Browser)
Operating
Compiler System CDA 3101
Assembler (Win, Linux)
Software
Instruction Set
Hardware Processor Memory I/O system Architecture

Datapath & Control


Digital Design
Circuit Design Important
transistors for Quizzes!

• Coordination of many levels of abstraction


CDA 3101 Textbook
Textbook: “P&H”
Computer Organization
and Design
Patterson and Hennessy
Fifth Edition
Morgan Kaufmann
© 2014
ISBN: 9780124077263
Course Overview
• Performance issues (Ch 1 – P&H 5th Edition)
• A specific instruction set architecture (Ch 2)
• Arithmetic and how to build an ALU (Ch 3)
• Constructing a processor to execute our
instructions (Ch 4)
• Pipelining to improve performance (Ch 4)
• Caches, main, and virtual memory, I/O (Ch 5)
• Multiprocessor Architectures (Ch 6)
• Future Computing Technologies (instructor)
CDA 3101 Big Ideas
• 5 Classic components of a Computer
• Data can be anything (integers, floating point,
characters): a program determines what it is
• Stored program concept: instructions just data
• Principle of Locality, exploited via a memory
hierarchy (cache and virtual memory)
• Greater performance by exploiting parallelism
• Principle of abstraction, used to build complex
systems as layers
• Compilation v. interpretation thru system layers
• Principles/Pitfalls of Performance Measurement
Course Administration
• Instructor:
– Dr. Schmalz ([email protected], CSE 446, 352-505-1561)
• TAs:
– TBD [email protected]
– TBD [email protected]
– TBD [email protected]
• Web site: www.cise.ufl.edu/~mssz/CompOrg/Top-Level.html
• Canvas site is in progress
• Text: Computer Organization and Design: The Hardware
Software Interface, Fifth Edition, Patterson and Hennessy
Course Evaluation
• Grade breakdown
– Midterm Exam (2) 40% 420 points
– Final Exam 25% 240 points
– Quizzes (5) 10% 100 points
– Homework Assignments (5) 25% 240 points
TOTAL 100% 1000 points
• Scores posted on Canvas site (as available)
– Grade changes: Work with TA
– Fri 25 Apr 2016 deadline to correct online scores
• No Cheating – No Curving in this Course
Levels of Representation
temp = v[k];
High Level Language v[k] = v[k+1];
Program (e.g., C)
v[k+1] = temp;
CDA3101 Compiler
lw $t0, 0($2)
Assembly Language lw $t1, 4($2)
Program (e.g.,MIPS)
sw$t1, 0($2)
Assembler sw$t0, 4($2)
Machine Language 0000 1001 1100 0110 1010 1111 0101 1000
Program (MIPS) 1010 1111 0101 1000 0000 1001 1100 0110
1100 0110 1010 1111 0101 1000 0000 1001
0101 1000 0000 1001 1100 0110 1010 1111
Machine Interpretation

Control Signal
Specification
°
°
A Six-Level Computer
Big Idea: Multilevel Machine
Evolution of Multilevel Machines
1. Bare hardware
2. Microprogramming
3. Operating system
4. Compilers
5. Hardware / software interface
– Simple ISA
– CISC
– RISC
– FISC
Design Principles
• CISC vs. RISC
• Instructions directly executed by hardware
• Maximize instruction issue rate (ILP)
• Simple instructions (easy to decode)
• Access to memory only via load/store
• Plenty of registers
• Pipelining
Computer Organization

Von Neumann
Machine

KNOW FOR
QUIZ

Processor
Datapath
Memory I/O
Bus-Based Computer
Anatomy of a Modern PC
Multiprocessors

Local
Memory
Conclusion
• < 16 weeks to learn big ideas in CS/CEN
– Principle of abstraction, used to build systems as layers
– Pliable Data: a program determines what it is
– Stored program concept: instructions are just data
– Principle of Locality, exploited via memory hierarchy
– Greater performance by exploiting parallelism (pipeline)
– Compilation v. interpretation to move downward through
layers of system
– Principles/Pitfalls of Performance Measurement

You might also like