Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 34 – Input / Output 2008-04-23 “Arduino is an open-source electronics prototyping.

Slides:



Advertisements
Similar presentations
Memory Mapped I/O. What is Memory Mapped I/O? Instead of having special methods for accessing the values to be read or written, just get them from memory.
Advertisements

Input and Output CS 215 Lecture #20.
Avishai Wool lecture Introduction to Systems Programming Lecture 8 Input-Output.
CS61C L27 I/O & Networks (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #27 I/O.
EE30332 Ch8 DP – 1 Ch 8 Interfacing Processors and Peripherals Buses °Fundamental tool for designing and building computer systems divide the problem into.
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Lecture 36: IO Basics Instructor: Dan Garcia
CS61C L35 VM I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
CS61C L36 Input / Output (1) Garcia, Spring 2007 © UCB Robson disk $  Intel has a NAND flash-based disk cache which can speed up access for laptops and.
CS61C L24 Introduction to CPU Design (1) Garcia, Spring 2007 © UCB Cell pic to web site  A new MS app lets people search the web based on a digital cell.
CS 61C L24 VM II (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS 430 – Computer Architecture 1 CS 430 – Computer Architecture Input/Output: Polling and Interrupts William J. Taffe using the slides of David Patterson.
CS61C L25 I/O (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #25: I/O Andy Carle.
Architectural Support for Operating Systems. Announcements Most office hours are finalized Assignments up every Wednesday, due next week CS 415 section.
CS61C L18 Introduction to CPU Design (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
CS 61C L35 Caches IV / VM I (1) Garcia, Fall 2004 © UCB Andy Carle inst.eecs.berkeley.edu/~cs61c-ta inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS61C L24 Input/Output, Networks I (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
OS Spring’03 Introduction Operating Systems Spring 2003.
CS61C L26 Virtual Memory II (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #26.
CS61C L13 I/O © UC Regents 1 CS61C - Machine Structures Lecture 13 - Input/Output: Polling and Interrupts October 11, 2000 David Patterson
CS61C L24 Introduction to CPU Design (1) Garcia, Fall 2006 © UCB Fedora Core 6 (FC6) just out  The latest version of the distro has been released; they.
CS61C L33 Virtual Memory I (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c UC Berkeley.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 24 Introduction to CPU design Stanford researchers developing 3D camera.
CS 61C L39 I/O (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS61C L37 I/O (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
Cs 61C L12 I/O.1 Patterson Spring 99 ©UCB CS61C Input/Output Lecture 12 February 26, 1999 Dave Patterson (http.cs.berkeley.edu/~patterson) www-inst.eecs.berkeley.edu/~cs61c/schedule.html.
Instructor: Justin Hsia CS 61C: Great Ideas in Computer Architecture Input/Output 8/12/20131Summer Lecture #28.
I/O Tanenbaum, ch. 5 p. 329 – 427 Silberschatz, ch. 13 p
INPUT-OUTPUT ORGANIZATION
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Operating Systems, Interrupts, Virtual Memory Instructors: Krste Asanovic & Vladimir.
3/11/2002CSE Input/Output Input/Output Control Datapath Memory Processor Input Output Memory Input Output Network Control Datapath Processor.
Input and Output Computer Organization and Assembly Language: Module 9.
CHAPTER 2: COMPUTER-SYSTEM STRUCTURES Computer system operation Computer system operation I/O structure I/O structure Storage structure Storage structure.
CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Input/Output CS 342 – Operating Systems Ibrahim Korpeoglu Bilkent University.
Chapter 8 I/O. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 8-2 I/O: Connecting to Outside World So far,
CS 61C L6.2.2 Interrupts (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture Interrupts Kurt Meinz inst.eecs.berkeley.edu/~cs61c.
2009 Sep 10SYSC Dept. Systems and Computer Engineering, Carleton University F09. SYSC2001-Ch7.ppt 1 Chapter 7 Input/Output 7.1 External Devices 7.2.
Chapter 2: Computer-System Structures Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection Network Structure.
Accessing I/O Devices Processor Memory BUS I/O Device 1 I/O Device 2.
13-Nov-15 (1) CSC Computer Organization Lecture 7: Input/Output Organization.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 35 – Input / Output We’ve merged 3 lectures into 1… See 2008Sp for full.
CH10 Input/Output DDDData Transfer EEEExternal Devices IIII/O Modules PPPProgrammed I/O IIIInterrupt-Driven I/O DDDDirect Memory.
Interrupt driven I/O. MIPS RISC Exception Mechanism The processor operates in The processor operates in user mode user mode kernel mode kernel mode Access.
CE Operating Systems Lecture 2 Low level hardware support for operating systems.
CS2100 Computer Organisation Input/Output – Own reading only (AY2015/6) Semester 1 Adapted from David Patternson’s lecture slides:
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Operating Systems, Interrupts, Virtual Memory Instructors: John Wawrzynek & Vladimir.
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Lecture 37: IO Basics Instructor: Dan Garcia
Adapted from Computer Organization and Design, Patterson & Hennessy ECE232: Hardware Organization and Design Part 17: Input/Output Chapter 6
CE Operating Systems Lecture 2 Low level hardware support for operating systems.
1 Lecture 1: Computer System Structures We go over the aspects of computer architecture relevant to OS design  overview  input and output (I/O) organization.
Lecture on Central Process Unit (CPU)
Interrupt driven I/O Computer Organization and Assembly Language: Module 12.
Processor Memory Processor-memory bus I/O Device Bus Adapter I/O Device I/O Device Bus Adapter I/O Device I/O Device Expansion bus I/O Bus.
1 Device Controller I/O units typically consist of A mechanical component: the device itself An electronic component: the device controller or adapter.
Interrupts and Exception Handling. Execution We are quite aware of the Fetch, Execute process of the control unit of the CPU –Fetch and instruction as.
10/15: Lecture Topics Input/Output –Types of I/O Devices –How devices communicate with the rest of the system communicating with the processor communicating.
Chapter 8 Input/Output An Hong 2015 Fall School of Computer Science and Technology Lecture on Introduction to.
CS 110 Computer Architecture Lecture 22: Operating Systems, Interrupts, Virtual Memory Instructor: Sören Schwertfeger School.
Operating Systems (CS 340 D)
Inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 35 – Input / Output Lecturer SOE Dan Garcia
Computer Architecture
Instructors: Yuanqing Cheng
Operating Systems Chapter 5: Input/Output Management
Chapter 8 I/O.
Interrupts and Exception Handling
Chapter 8 I/O.
Lectures 9-1: I/O Interfacing
CS61C - Machine Structures Lecture 14 - Input/Output
Chapter 13: I/O Systems.
Interrupts and Exception Handling
Presentation transcript:

inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 34 – Input / Output “Arduino is an open-source electronics prototyping platform based on flexible, easy- to-use hardware and software. It's intended for artists, designers, hobbyists, and anyone interested in creating interactive objects or environments.” Available for Mac / Windows / Linux. You can buy one or build your own. Lecturer SOE Dan Garcia Hi to Gary McCoy from Tampa Florida !

CS61C L35 Input / Output (2) Garcia, Spring 2008 © UCB Review  Manage memory to disk? Treat as cache  Included protection as bonus, now critical  Use Page Table of mappings for each process vs. tag/data in cache  TLB is cache of Virtual  Physical addr trans  Virtual Memory allows protected sharing of memory between processes  Spatial Locality means Working Set of Pages is all that must be in memory for process to run fairly well

CS61C L35 Input / Output (3) Garcia, Spring 2008 © UCB Recall : 5 components of any Computer Processor (active) Computer Control (“brain”) Datapath (“brawn”) Memory (passive) (where programs, data live when running) Devices Input Output Keyboard, Mouse Display, Printer Disk, Network Earlier LecturesCurrent Lectures

CS61C L35 Input / Output (4) Garcia, Spring 2008 © UCB Motivation for Input/Output  I/O is how humans interact with computers  I/O gives computers long-term memory.  I/O lets computers do amazing things:  Read pressure of synthetic hand and control synthetic arm and hand of fireman  Control propellers, fins, communicate in BOB (Breathable Observable Bubble)  Computer without I/O like a car w/no wheels; great technology, but gets you nowhere

CS61C L35 Input / Output (5) Garcia, Spring 2008 © UCB  I/O Speed: bytes transferred per second (from mouse to Gigabit LAN: 7 orders of mag!)  DeviceBehaviorPartner Data Rate (KBytes/s) KeyboardInputHuman0.01 MouseInputHuman0.02 Voice outputOutputHuman5.00 Floppy diskStorageMachine50.00 Laser PrinterOutputHuman Magnetic DiskStorageMachine10, Wireless NetworkI or OMachine 10, Graphics DisplayOutputHuman30, Wired LAN NetworkI or OMachine125, When discussing transfer rates, use 10 x I/O Device Examples and Speeds

CS61C L35 Input / Output (6) Garcia, Spring 2008 © UCB What do we need to make I/O work?  A way to connect many types of devices  A way to control these devices, respond to them, and transfer data  A way to present them to user programs so they are useful cmd reg. data reg. Operating System APIsFiles Proc Mem PCI Bus SCSI Bus

CS61C L35 Input / Output (7) Garcia, Spring 2008 © UCB Instruction Set Architecture for I/O  What must the processor do for I/O?  Input: reads a sequence of bytes  Output: writes a sequence of bytes  Some processors have special input and output instructions  Alternative model (used by MIPS):  Use loads for input, stores for output  Called Memory Mapped Input/Output  A portion of the address space dedicated to communication paths to Input or Output devices (no memory there)

CS61C L35 Input / Output (8) Garcia, Spring 2008 © UCB Memory Mapped I/O  Certain addresses are not regular memory  Instead, they correspond to registers in I/O devices cntrl reg. data reg. 0 0xFFFFFFFF 0xFFFF0000 address

CS61C L35 Input / Output (9) Garcia, Spring 2008 © UCB Processor-I/O Speed Mismatch  1GHz microprocessor can execute 1 billion load or store instructions per second, or 4,000,000 KB/s data rate  I/O devices data rates range from 0.01 KB/s to 125,000 KB/s  Input: device may not be ready to send data as fast as the processor loads it  Also, might be waiting for human to act  Output: device not be ready to accept data as fast as processor stores it  What to do?

CS61C L35 Input / Output (10) Garcia, Spring 2008 © UCB Processor Checks Status before Acting  Path to device generally has 2 registers:  Control Register, says it’s OK to read/write (I/O ready) [think of a flagman on a road]  Data Register, contains data  Processor reads from Control Register in loop, waiting for device to set Ready bit in Control reg (0  1) to say its OK  Processor then loads from (input) or writes to (output) data register  Load from or Store into Data Register resets Ready bit (1  0) of Control Register

CS61C L35 Input / Output (11) Garcia, Spring 2008 © UCB SPIM I/O Simulation  SPIM simulates 1 I/O device: memory- mapped terminal (keyboard + display)  Read from keyboard (receiver); 2 device regs  Writes to terminal (transmitter); 2 device regs Received Byte Receiver Data 0xffff0004 Unused ( ) (IE) Receiver Control 0xffff0000 Ready (I.E.) Unused ( ) Transmitted Byte Transmitter Control 0xffff0008 Transmitter Data 0xffff000c Ready (I.E.) Unused ( ) Unused

CS61C L35 Input / Output (12) Garcia, Spring 2008 © UCB SPIM I/O  Control register rightmost bit (0): Ready  Receiver: Ready == 1 means character in Data Register not yet been read; 1  0 when data is read from Data Reg  Transmitter: Ready == 1 means transmitter is ready to accept a new character; 0  Transmitter still busy writing last char  I.E. bit discussed later  Data register rightmost byte has data  Receiver: last char from keyboard; rest = 0  Transmitter: when write rightmost byte, writes char to display

CS61C L35 Input / Output (13) Garcia, Spring 2008 © UCB  Input: Read from keyboard into $v0 lui$t0, 0xffff #ffff0000 Waitloop:lw$t1, 0($t0) #control andi$t1,$t1,0x1 beq$t1,$zero, Waitloop lw$v0, 4($t0) #data  Output: Write to display from $a0 lui$t0, 0xffff #ffff0000 Waitloop:lw$t1, 8($t0) #control andi$t1,$t1,0x1 beq$t1,$zero, Waitloop sw$a0, 12($t0) #data  Processor waiting for I/O called “Polling”  “Ready” bit is from processor’s point of view! I/O Example

CS61C L35 Input / Output (14) Garcia, Spring 2008 © UCB Administrivia  Only 8 lectures after this one! :-(  About every third by an outstanding TA  Project 3 will be graded face-to-face, check web page for scheduling  Project 4 (Cache simulator) out already  You may work in pairs for this project!  Do the performance competition!  You may work in pairs for this project!  Final Exam: M 5-8pm loc TBA

CS61C L35 Input / Output (15) Garcia, Spring 2008 © UCB Week #MonWedThu LabFri #14 This week I/O Basics P4 out VM I/O Networks (Brian) #15 Next week I/O Disks Performance P4 due I/O Polling Writing really fast code (Casey) #16 Penultimate week o’ classes Parallelism in Processor Design IntRA- machine Parallelism (Matt) Parallel IntER- machine Parallelism Perf comp due #17 Last week o’ classes LAST CLASS Summary, Review, & HKN Evals #18 FINAL REVIEW 2-5pm 10 Evans FINAL EXAM Mon 5-8pm location TBA Upcoming Calendar

CS61C L35 Input / Output (16) Garcia, Spring 2008 © UCB What is the alternative to polling?  Wasteful to have processor spend most of its time “spin-waiting” for I/O to be ready  Would like an unplanned procedure call that would be invoked only when I/O device is ready  Solution: use exception mechanism to help I/O. Interrupt program when I/O ready, return when done with data transfer

CS61C L35 Input / Output (17) Garcia, Spring 2008 © UCB I/O Interrupt  An I/O interrupt is like overflow exceptions except:  An I/O interrupt is “asynchronous”  More information needs to be conveyed  An I/O interrupt is asynchronous with respect to instruction execution:  I/O interrupt is not associated with any instruction, but it can happen in the middle of any given instruction  I/O interrupt does not prevent any instruction from completion

CS61C L35 Input / Output (18) Garcia, Spring 2008 © UCB Interrupt-Driven Data Transfer (1) I/O interrupt (2) save PC Memory add sub and or user program read store... jr interrupt service routine (3) jump to interrupt service routine (4) perform transfer (5)

CS61C L35 Input / Output (19) Garcia, Spring 2008 © UCB SPIM I/O Simulation: Interrupt Driven I/O  I.E. stands for Interrupt Enable  Set Interrupt Enable bit to 1 have interrupt occur whenever Ready bit is set Received Byte Receiver Data 0xffff0004 Unused ( ) (IE) Receiver Control 0xffff0000 Ready (I.E.) Unused ( ) Transmitted Byte Transmitter Control 0xffff0008 Transmitter Data 0xffff000c Ready (I.E.) Unused ( ) Unused

CS61C L35 Input / Output (20) Garcia, Spring 2008 © UCB Peer Instruction A. A faster CPU will result in faster I/O. B. Hardware designers handle mouse input with interrupts since it is better than polling in almost all cases. C. Low-level I/O is actually quite simple, as it’s really only reading and writing bytes. ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT

CS61C L35 Input / Output (21) Garcia, Spring 2008 © UCB A. A faster CPU will result in faster I/O. B. Hardware designers handle mouse input with interrupts since it is better than polling in almost all cases. C. Low-level I/O is actually quite simple, as it’s really only reading and writing bytes. F A L S E T R U E A. Less sync data idle time B. Because mouse has low I/O rate polling often used C. Concurrency, device requirements vary! F A L S E ABC 0: FFF 1: FFT 2: FTF 3: FTT 4: TFF 5: TFT 6: TTF 7: TTT Peer Instruction Answer

CS61C L35 Input / Output (22) Garcia, Spring 2008 © UCB “And in conclusion…”  I/O gives computers their 5 senses  I/O speed range is 100-million to one  Processor speed means must synchronize with I/O devices before use  Polling works, but expensive  processor repeatedly queries devices  Interrupts works, more complex  devices causes an exception, causing OS to run and deal with the device  I/O control leads to Operating Systems

CS61C L35 Input / Output (23) Garcia, Spring 2008 © UCB Bonus slides  These are extra slides that used to be included in lecture notes, but have been moved to this, the “bonus” area to serve as a supplement.  The slides will appear in the order they would have in the normal presentation

CS61C L35 Input / Output (24) Garcia, Spring 2008 © UCB Definitions for Clarification  Exception: signal marking that something “out of the ordinary” has happened and needs to be handled  Interrupt: asynchronous exception  Trap: synchronous exception  Note: Many systems folks say “interrupt” to mean what we mean when we say “exception”.

CS61C L35 Input / Output (25) Garcia, Spring 2008 © UCB Cost of Polling?  Assume for a processor with a 1GHz clock it takes 400 clock cycles for a polling operation (call polling routine, accessing the device, and returning). Determine % of processor time for polling  Mouse: polled 30 times/sec so as not to miss user movement  Floppy disk: transfers data in 2-Byte units and has a data rate of 50 KB/second. No data transfer can be missed.  Hard disk: transfers data in 16-Byte chunks and can transfer at 16 MB/second. Again, no transfer can be missed.

CS61C L35 Input / Output (26) Garcia, Spring 2008 © UCB % Processor time to poll [p. 677 in book]  Mouse Polling [clocks/sec] = 30 [polls/s] * 400 [clocks/poll] = 12K [clocks/s]  % Processor for polling: 12*103 [clocks/s] / 1*109 [clocks/s] = %  Polling mouse little impact on processor  Frequency of Polling Floppy = 50 [KB/s] / 2 [B/poll] = 25K [polls/s]  Floppy Polling, Clocks/sec = 25K [polls/s] * 400 [clocks/poll] = 10M [clocks/s]  % Processor for polling: 10*106 [clocks/s] / 1*109 [clocks/s] = 1%  OK if not too many I/O devices

CS61C L35 Input / Output (27) Garcia, Spring 2008 © UCB % Processor time to poll hard disk  Frequency of Polling Disk = 16 [MB/s] / 16 [B/poll] = 1M [polls/s]  Disk Polling, Clocks/sec = 1M [polls/s] * 400 [clocks/poll] = 400M [clocks/s]  % Processor for polling: 400*106 [clocks/s] / 1*109 [clocks/s] = 40%  Unacceptable

CS61C L35 Input / Output (28) Garcia, Spring 2008 © UCB  Find the % of processor consumed if the hard disk is only active 5% of the time. Assuming 500 clock cycle overhead for each transfer, including interrupt:  Disk Interrupts/s = 16 [MB/s] / 16 [B/interrupt] = 1M [interrupts/s]  Disk Interrupts [clocks/s] = 1M [interrupts/s] * 500 [clocks/interrupt] = 500,000,000 [clocks/s]  % Processor for during transfer: 500*10 6 [clocks/s] / 1*10 9 [clocks/s] = 50%  Disk active 5%  5% * 50%  2.5% busy Benefit of Interrupt-Driven I/O