CS61C L13 I/O © UC Regents 1 CS61C - Machine Structures Lecture 13 - Input/Output: Polling and Interrupts October 11, 2000 David Patterson

Slides:



Advertisements
Similar presentations
1 IKI20210 Pengantar Organisasi Komputer Kuliah No. 19: I/O, Interupsi 20 November 2002 Bobby Nazief Johny Moningka
Advertisements

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.
Input and Output CS 215 Lecture #20.
1/1/ / faculty of Electrical Engineering eindhoven university of technology Introduction Part 3: Input/output and co-processors dr.ir. A.C. Verschueren.
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 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.
COMP3221: Microprocessors and Embedded Systems Lecture 15: Interrupts I Lecturer: Hui Wu Session 1, 2005.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 34 – Input / Output “Arduino is an open-source electronics prototyping.
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.
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,
CS61C L24 Input/Output, Networks I (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
Basic Input/Output Operations
CS61C L26 Virtual Memory II (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #26.
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.
Mehmet Can Vuran, Instructor University of Nebraska-Lincoln Acknowledgement: Overheads adapted from those provided by the authors of the textbook.
1 Computer System Overview Chapter 1 Review of basic hardware concepts.
What are Exception and Interrupts? MIPS terminology Exception: any unexpected change in the internal control flow – Invoking an operating system service.
MIPS I/O and Interrupt. SPIM I/O and MIPS Interrupts The materials of this lecture can be found in A7-A8 (3 rd Edition) and B7-B8 (4 th Edition).
Input/Output. Input/Output Problems Wide variety of peripherals —Delivering different amounts of data —At different speeds —In different formats All slower.
1 IKI10230 Pengantar Organisasi Komputer Bab 4.1: Input/Output & Interrupt 19 Maret 2003 Bobby Nazief Qonita Shahab
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Operating Systems, Interrupts, Virtual Memory Instructors: Krste Asanovic & Vladimir.
Input and Output Computer Organization and Assembly Language: Module 9.
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,
MIPS I/O and Interrupt. .data val1:.float 0.6 val2:.float 0.8 msg_done:.asciiz "done\n".text.globl main main: li.s $f0, mfc1 $a0, $f0 jal calsqrt.
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.
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.
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.
Fall 2000M.B. Ibáñez Lecture 25 I/O Systems. Fall 2000M.B. Ibáñez Categories of I/O Devices Human readable –used to communicate with the user –video display.
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.
MIPS I/O and Interrupt.
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.
Concurrency, Processes, and System calls Benefits and issues of concurrency The basic concept of process System calls.
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
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)
Input/Output Problems Wide variety of peripherals —Delivering different amounts of data —At different speeds —In different formats All slower than CPU.
Interrupt driven I/O Computer Organization and Assembly Language: Module 12.
Input Output Techniques Programmed Interrupt driven Direct Memory Access (DMA)
بسم الله الرحمن الرحيم MEMORY AND I/O.
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.
MIPS I/O and Interrupt.
Inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine Structures Lecture 35 – Input / Output Lecturer SOE Dan Garcia
Some of the slides are adopted from Prof. David Patterson (UCB)
MIPS I/O and Interrupt.
Computer Architecture
MIPS I/O and Interrupt.
Operating Systems Chapter 5: Input/Output Management
Interrupts and Exception Handling
MIPS I/O and Interrupt.
Chapter 8 I/O.
Lectures 9-1: I/O Interfacing
CS61C - Machine Structures Lecture 14 - Input/Output
COMP3221: Microprocessors and Embedded Systems
Chapter 13: I/O Systems.
Interrupts and Exception Handling
Presentation transcript:

CS61C L13 I/O © UC Regents 1 CS61C - Machine Structures Lecture 13 - Input/Output: Polling and Interrupts October 11, 2000 David Patterson

CS61C L13 I/O © UC Regents 2 Review 1/2 °Pointer is high level language version of address °Like goto, with self-imposed discipline can achieve clarity and simplicity Dereferences in C turn into loads or stores in MIPS code Powerful, dangerous concept: can cause difficult to fix bugs °C supports pointers, pointer arithmetic °Java structure pointers have many of the same potential problems

CS61C L13 I/O © UC Regents 3 Review 2/2 °MIPS Signed v. Unsigned "overloaded" term Do/Don't sign extend (lb, lbu) Don't overflow (addu, addiu, subu, multu, divu) Do signed/unsigned compare (slt,slti/sltu,sltiu) Immediate sign extension independent of term (andi, ori zero extend; rest sign extend) °Assembler uses $at to turn MAL into TAL

CS61C L13 I/O © UC Regents 4 Outline °I/O Background °Polling °Interrupts

CS61C L13 I/O © UC Regents 5 Anatomy: 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 (where programs, data live when not running)

CS61C L13 I/O © UC Regents 6 Motivation for Input/Output °I/O is how humans interact with computers °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) Read bar codes of items in refrigerator °Computer without I/O like a car without wheels; great technology, but won’t get you anywhere

CS61C L13 I/O © UC Regents 7 I/O Device Examples and Speeds °I/O Speed: bytes transferred per second (from mouse to display: million-to-1) °DeviceBehaviorPartner Data Rate (Kbytes/sec) KeyboardInputHuman0.01 MouseInputHuman0.02 Line PrinterOutputHuman1.00 Floppy diskStorageMachine50.00 Laser PrinterOutputHuman Magnetic DiskStorageMachine10, Network-LANI or OMachine 10, Graphics DisplayOutputHuman30,000.00

CS61C L13 I/O © UC Regents 8 What do we need to make I/O work? °A way to connect many types of devices to the Proc-Mem °A way to control these devices, respond to them, and transfer data °A way to present them to user programs so they are useful Proc Mem PCI Bus SCSI Bus cmd reg. data reg. Operating System Windows Files

CS61C L13 I/O © UC Regents 9 Instruction Set Architecture for I/O °Some machines have special input and output instructions °Alternative model (used by MIPS): Input: ~ reads a sequence of bytes Output: ~ writes a sequence of bytes °Memory also a sequence of bytes, so 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 L13 I/O © UC Regents 10 Memory Mapped I/O °Certain addresses are not regular memory °Instead, they correspond to registers in I/O devices 0 0xFFFFFFFF 0xFFFF0000 cmd reg. data reg. address

CS61C L13 I/O © UC Regents 11 Processor-I/O Speed Mismatch °500 MHz microprocessor can execute 500 million load or store instructions per second, or 2,000,000 KB/s data rate I/O devices from 0.01 KB/s to 30,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 may not be ready to accept data as fast as processor stores it °What to do?

CS61C L13 I/O © UC Regents 12 Processor Checks Status before Acting °Path to device generally has 2 registers: 1 register says it’s OK to read/write (I/O ready), often called Control Register 1 register that contains data, often called Data Register °Processor reads from Control Register in loop, waiting for device to set Ready bit in Control reg to say its OK (0  1) °Processor then loads from (input) or writes to (output) data register Load from device/Store into Data Register resets Ready bit (1  0) of Control Register

CS61C L13 I/O © UC Regents 13 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 L13 I/O © UC Regents 14 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 L13 I/O © UC Regents 15 I/O Example °Input: Read from keyboard into $v0 lui$t0, 0xffff #ffff0000 Waitloop:lw$t1, 0($t0) #control andi$t1,$t1,0x0001 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,0x0001 beq$t1,$zero, Waitloop sw$a0, 12($t0) #data °Processor waiting for I/O called “Polling”

CS61C L13 I/O © UC Regents 16 Administrivia °Midterm will be in 2 weeks 5-8 pm Old midterms will be online

CS61C L13 I/O © UC Regents 17 “What’s This Stuff Good For?” Remote Diagnosis: “NeoRest ExII,” a high-tech toilet features microprocessor-controlled seat warmers, automatic lid openers, air deodorizers, water sprays and blow-dryers that do away with the need for toilet tissue. About 25 percent of new homes in Japan have a “washlet,” as these toilets are called. Toto's engineers are now working on a model that analyzes urine to determine blood-sugar levels in diabetics and then automatically sends a daily report, by modem, to the user's physician. One Digital Day,

CS61C L13 I/O © UC Regents 18 Cost of Polling? °Assume for a processor with a 500-MHz 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 8 MB/second. Again, no transfer can be missed.

CS61C L13 I/O © UC Regents 19 % Processor time to poll mouse, floppy °Mouse Polling Clocks/sec = 30 * 400 = clocks/sec °% Processor for polling: 12*10 3 /500*10 6 = 0.002%  Polling mouse little impact on processor °Times Polling Floppy/sec = 50 KB/s /2B = 25K polls/sec °Floppy Polling Clocks/sec = 25K * 400 = 10,000,000 clocks/sec °% Processor for polling: 10*10 6 /500*10 6 = 2%  OK if not too many I/O devices

CS61C L13 I/O © UC Regents 20 % Processor time to hard disk °Times Polling Disk/sec = 8 MB/s /16B = 500K polls/sec °Disk Polling Clocks/sec = 500K * 400 = 200,000,000 clocks/sec °% Processor for polling: 200*10 6 /500*10 6 = 40%  Unacceptable

CS61C L13 I/O © UC Regents 21 What is the alternative to polling? °Wasteful to have processor spend most of its time “spin-waiting” for I/O to be ready °Wish we could have 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 L13 I/O © UC Regents 22 I/O Interrupt °An I/O interrupt is like an 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 L13 I/O © UC Regents 23 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: These are different from the book’s definitions.

CS61C L13 I/O © UC Regents 24 Interrupt Driven Data Transfer (1) I/O interrupt (2) save PC (3) interrupt service addr Memory add sub and or user program read store... jr interrupt service routine (4) (5)

CS61C L13 I/O © UC Regents 25 Instruction Set Support for I/O Interrupt °Save the PC for return But where? °Where go when interrupt occurs? MIPS defines location: 0x °Determine cause of interrupt? MIPS has Cause Register, 4-bit field (bits 5 to 2) gives cause of exception

CS61C L13 I/O © UC Regents 26 Instruction Set Support for I/O Interrupt °Portion of MIPS architecture for interrupts called “coprocessor 0” °Coprocessor 0 Instructions Data transfer: lwc0, swc0 Move: mfc0, mtc0 °Coprocessor 0 Registers: name number usage BadVAddr $8 Address of Int Status……. $12 Interrupt enable Cause $13 Exception type EPC $14 Return address

CS61C L13 I/O © UC Regents 27 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 Transmitted Byte (IE)Receiver Control 0xffff0000 Transmitter Control 0xffff0008 Transmitter Data 0xffff000c Receiver Data 0xffff0004 Ready (I.E.) Ready (I.E.) Unused ( ) Unused

CS61C L13 I/O © UC Regents 28 Benefit of Interrupt-Driven I/O °500 clock cycle overhead for each transfer, including interrupt. Find the % of processor consumed if the hard disk is only active 5% of the time. °Interrupt rate = polling rate Disk Interrupts/sec = 8 MB/s /16B = 500K interrupts/sec Disk Polling Clocks/sec = 500K * 500 = 250,000,000 clocks/sec % Processor for during transfer: 250*10 6 /500*10 6 = 50% °Disk active 5%  5% * 50%  2.5% busy

CS61C L13 I/O © UC Regents 29 Questions Raised about Interrupts °Which I/O device caused exception? Needs to convey the identity of the device generating the interrupt °Can avoid interrupts during the interrupt routine? What if more important interrupt occurs while servicing this interrupt? Allow interrupt routine to be entered again? °Who keeps track of status of all the devices, handle errors, know where to put/supply the I/O data?

CS61C L13 I/O © UC Regents 30 4 Responsibilities leading to OS °The I/O system is shared by multiple programs using the processor °Low-level control of I/O device is complex because requires managing a set of concurrent events and because requirements for correct device control are often very detailed °I/O systems often use interrupts to communicate information about I/O operations °Would like I/O services for all user programs under safe control

CS61C L13 I/O © UC Regents 31 4 Functions OS must provide °OS guarantees that user’s program accesses only the portions of I/O device to which user has rights (e.g., file access) °OS provides abstractions for accessing devices by supplying routines that handle low-level device operations °OS handles the exceptions generated by I/O devices (and arithmetic exceptions generated by a program) °OS tries to provide equitable access to the shared I/O resources, as well as schedule accesses in order to enhance system performance

CS61C L13 I/O © UC Regents 32 Things to Remember °I/O gives computers their 5 senses °I/O speed range is 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