lecture_05 - ECE 190 Lecture 05 September 6, 2011 1 V....

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ECE 190 Lecture 05 September 6, 2011 1 V. Kindratenko The von Neumann model Lecture Topics FSM (continued from last lecture) Von Neumann model LC-3 as a von Neumann machine Lecture materials Textbook Ch. 4 Textbook Appendix C Homework/Projects HW2 due September 7 at 5pm in the ECE 190 drop-off box Announcements Learn SVN! o Go over Lab 1 if you are still having issues o Email Keith Campbell if you still do not have access to SVN o Make sure you learn how to check (via webpage) that your submission went through o We will not accept lab and MP submissions any other way! o We will have an extra session about SVN on Wednesday at 5:30pm in DCL 440 From now on, labs will be due on Mondays at 5pm ECE 190 Lecture 05 September 6, 2011 2 V. Kindratenko Von Neumann model Concept The von Neumann model/architecture refers to a computer organization which is based on the stored-program concept Stored-program concept refers to the computer architecture in which data and program are stored in the same memory o The von Neumann architecture stored-program concept First computers built in 1940s were program-controlled computers o Programmed by setting switches and physically connecting functional units Stored-program digital computes kept their program (set of instructions) and data in read-write random-access memory Von Neumann model components Memory stores data and program Processing unit performs the data processing Input means to enter data and program Output means to extract results Control unit controls the order of the instruction execution Processing unit Temporary storage ALU Control unit PC IR FSM Memory MDR MAR Input device Output device ECE 190 Lecture 05 September 6, 2011 3 V. Kindratenko Memory In the last lecture we built a 2 2-by-3-bit memory o 3-bit addressability at each memory location we can store 3 bits of information o 2 2 address space there are that many unique memory locations that can be addressed individually o This memory can be thought of as an array, or sequence of locations that are sequentially numbered 00 111 01 10 010 11 address what is stored at a given location note address and the value stored in memory at that address o In this example, memory location 01 contains value 111 and memory lication11 contains value 010 A modern computer with 1 GB of memory o 8-bit (one byte) addressability at each memory location we can store one byte of data o 2 30 address space - 2 30 uniquely addressable memory locations In general, we will think of memory as a device capable of storing m n-bit words o n addressability o m address space o to interact with the memory, we will need n-bit data line, log 2 m-bit address line, and 1- bit WE line n m . . ....
View Full Document

This note was uploaded on 01/24/2012 for the course ECE 190 taught by Professor Hutchinson during the Spring '08 term at University of Illinois, Urbana Champaign.

Page1 / 11

lecture_05 - ECE 190 Lecture 05 September 6, 2011 1 V....

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online