09 Input Output

Chapter 9: Input/Output
Operating System Course
Ho Dac Phuong, Msc Computer Networking & Telecommunication Department College of Technology Vietnam National University, Hanoi
hdphuong@vnu.edu.vn
http://www.coltech.vnu.edu.vn/courses/cour se/view.php?id=69
CH1.1
Introduction
Input/Output
5.1 Principles of I/O hardware 5.2 Principles of I/O software 5.3 I/O software layers 5.4 Disks 5.5 Clocks 5.6 Character-oriented terminals 5.7 Graphical user interfaces 5.8 Network terminals 5.9 Power management
CH1.2
Principles of I/O Hardware

Some typical device, network, and data base rates

CH1.3
Device Controllers
I/O devices have components: mechanical component electronic component The electronic component is the device controller may be able to handle multiple devices Controller's tasks convert serial bit stream to block of bytes perform error correction as necessary make available to main memory
CH1.4
Memory-Mapped I/O (1)

Separate I/O and memory space Memory-mapped I/O Hybrid

CH1.5
Memory-Mapped I/O (2)

(a) A single-bus architecture (b) A dual-bus memory architecture

CH1.6
Direct Memory Access (DMA)

Operation of a DMA transfer
CH1.7
Interrupts Revisited
How interrupts happens. Connections between devices and interrupt controller actually use interrupt lines on the bus rather than dedicated wires
CH1.8
Principles of I/O Software

Goals of I/O Software (1)
Device independence programs can access any I/O device without specifying device in advance
(floppy, hard drive, or CD-ROM)
Uniform naming name of a file or device a string or an integer not depending on which machine Error handling handle as close to the hardware as possible
CH1.9
Goals of I/O Software (2)

Synchronous vs. asynchronous transfers blocked transfers vs. interrupt-driven Buffering data coming off a device cannot be stored in final destination Sharable vs. dedicated devices disks are sharable tape drives would not be
CH1.10
Programmed I/O (1)

Steps in printing a string

CH1.11
Programmed I/O (2)

Writing a string to the printer using programmed I/O
CH1.12
Interrupt-Driven I/O
Writing a string to the printer using interrupt-driven I/O Code executed when print system call is made Interrupt service procedure
CH1.13
I/O Using DMA

Printing a string using DMA code executed when the print system call is made interrupt service procedure
CH1.14
I/O Software Layers

Layers of the I/O Software System
CH1.15
Interrupt Handlers (1)

Interrupt handlers are best hidden
have driver starting an I/O operation block until interrupt notifies of completion
Interrupt procedure does its task
then unblocks driver that started it
Steps must be performed in software after interrupt completed

1. 2.
Save regs not already saved by interrupt hardware Set up context for interrupt service procedure
CH1.16
Interrupt Handlers (2)

3. 4.
5. 6. 7.
8. 9.
Set up stack for interrupt service procedure Ack interrupt controller, reenable interrupts Copy registers from where saved Run service procedure Set up MMU context for process to run next Load new process' registers Start running the new process
CH1.17
Device Drivers
Logical position of device drivers is shown here Communications between drivers and device controllers goes over the bus
CH1.18
Device-Independent I/O Software (1)

Uniform interfacing for device drivers Buffering
Error reporting
Allocating and releasing dedicate devices Providing a device-independent block size
Functions of the device-independent I/O software

CH1.19

(a) Without a standard driver interface (b) With a standard driver interface
CH1.20
Device-Independent I/O Software (3)s

(a) Unbuffered input (b) Buffering in user space (c) Buffering in the kernel followed by copying to user space (d) Double buffering in the kernel
CH1.21

Networking may involve many copies

CH1.22
User-Space I/O Software

Layers of the I/O system and the main functions of each layer
CH1.23
Disks
Disk Hardware (1)
Disk parameters for the original IBM PC floppy disk and a Western Digital WD 18300 hard disk
CH1.24
Disk Hardware (2)

Physical geometry of a disk with two zones A possible virtual geometry for this disk
CH1.25
Disk Hardware (3)

Raid levels 0 through 2 Backup and parity drives are shaded

CH1.26
Hamming code
Consider a Hamming code to detect and correct for single-bit errors assuming each codeword contains a seven-bit data field, e.g. an ASCII character. for example. Such a coding scheme requires four check bits since, with this scheme, the check bits occupy all bit positions that are powers of 2. Such a code is thus known as an (11, 7) block code with a rate of 7/11 and a redundancy of . For example, the bit positions of the value 1001101 are: Bit Position 11 10 9 8 7 6 5 4 3 2 1 Bit value 1 0 0 x110x1xx
CH1.27
Hamming distance
Let x and y be two binary sequences of the same length. The Hamming distance between these two codes is the number of symbols that disagree. Suppose the code x is transmitted over the channel. Due to errors, y is received. The decoder will assign to y the code x that minimises the Hamming distance between x and y. For example, consider the codewords: a = 10000 b = 01100 c = 10011 If the transmitter sends 10000 but there is a single bit error and the receiver gets 10001, it can be seen that the "nearest" codeword is in fact 10000 and so the correct codeword is found.
CH1.28
Hamming distance
It can be shown that to detect n bit errors, a coding scheme requires the use of codewords with a Hamming distance of at least n + 1. It can also be shown that to correct n bit errors requires a coding scheme with at least a Hamming distnace of 2n + 1 between the codewords. By designing a good code, we try to ensure that the Hamming distance between possible codewords x is larger than the Hamming distance arising from errors
CH1.29
Hamming distance
11 = 1011 7 = 0111 6 = 0110 3 = 0011 1001 The transmitted codeword is thus: Bit Position 11 10 9 8 7 6 5 4 3 2 1 Bit value 1 0 011100101
CH1.30
Hamming distance
Similarly, at the receiver, the four-bit binary numbers corresponding to those bit positions having a binary 1, including the check bits, are again added together and, if no errors have occurred, the modulo 2 sum should be zero: 11= 1101 8 = 1100 7 = 0111 6 = 0110 3 = 0011 1 = 0001 0000
CH1.31
Hamming distance
Now consider a single-bit error; say bit 11 is corrupted from 1 to 0. The new modulo 2 sum would now be: 8 = 1100 7 = 0111 6 = 0110 3 = 0011 1 = 0001 1011 Firstly, the sum is non-zero, which indicates an error, and secondly the modulo 2 sum, equivalent to decimal 11, indicates that bit 11 is the erroneous bit. The latter would therefore be inverted to obtain the corrected codeword and hence data bits.
CH1.32
Disk Hardware (4)

Raid levels 3 through 5 Backup and parity drives are shaded

CH1.33
Disk Hardware (5)

Recording structure of a CD or CD-ROM

CH1.34
Disk Hardware (6)

Logical data layout on a CD-ROM
CH1.35
Disk Hardware (7)

Cross section of a CD-R disk and laser not to scale Silver CD-ROM has similar structure without dye layer with pitted aluminum layer instead of gold
CH1.36
Disk Hardware (8)

A double sided, dual layer DVD disk
CH1.37
Disk Formatting (1)

A disk sector
CH1.38
Disk Formatting (2)

An illustration of cylinder skew

CH1.39
Disk Formatting (3)

No interleaving Single interleaving Double interleaving

CH1.40
Disk Arm Scheduling Algorithms (1)

Time required to read or write a disk block determined by 3 factors 1. Seek time 2. Rotational delay 3. Actual transfer time Seek time dominates
Error checking is done by controllers
CH1.41

Operating System Course Initial position Pending requests
Shortest Seek First (SSF) disk scheduling algorithm
CH1.42

The elevator algorithm for scheduling disk requests
CH1.43
Error Handling
A disk track with a bad sector Substituting a spare for the bad sector Shifting all the sectors to bypass the bad one
CH1.44
Stable Storage
Analysis of the influence of crashes on stable writes
CH1.45
Clocks
Clock Hardware
A programmable clock
CH1.46
Clock Software (1)

Three ways to maintain the time of day

CH1.47
Clock Software (2)

Simulating multiple timers with a single clock

CH1.48
Soft Timers
A second clock available for timer interrupts specified by applications no problems if interrupt frequency is low
Soft timers avoid interrupts kernel checks for soft timer expiration before it exits to user mode how well this works depends on rate of kernel entries
CH1.49
Character Oriented Terminals

RS-232 Terminal Hardware
An RS-232 terminal communicates with computer 1 bit at a time Called a serial line bits go out in series, 1 bit at a time Windows uses COM1 and COM2 ports, first to serial lines Computer and terminal are completely independent
CH1.50
Input Software (1)

Central buffer pool Dedicated buffer for each terminal

CH1.51
Input Software (2)

Characters handled specially in canonical mode

CH1.52
Output Software
The ANSI escape sequences accepted by terminal driver on output ESC is ASCII character (0x1B) n,m, and s are optional numeric parameters
CH1.53
Display Hardware (1)

Parallel port
Memory-mapped displays driver writes directly into display's video RAM
CH1.54
Display Hardware (2)

A video RAM image simple monochrome display character mode Corresponding screen
the xs are attribute bytes

CH1.55
Input Software
Keyboard driver delivers a number driver converts to characters uses a ASCII table
Exceptions, adaptations needed for other languages many OS provide for loadable keymaps or code pages
CH1.56
Output Software for Windows (1)

Sample window located at (200,100) on XGA display

CH1.57

Skeleton of a Windows main program (part 1)

CH1.58

Skeleton of a Windows main program (part 2)

CH1.59

An example rectangle drawn using Rectangle

CH1.60

Copying bitmaps using BitBlt. before after

CH1.61

Examples of character outlines at different point sizes

CH1.62
Network Terminals
X Windows (1)
Clients and servers in the M.I.T. X Window System

CH1.63
X Windows (2)
Skeleton of an X Windows application program
CH1.64
The SLIM Network Terminal (1)

The architecture of the SLIM terminal system

CH1.65
The SLIM Network Terminal (2)

Messages used in the SLIM protocol from the server to the terminals
CH1.66
Power Management (1)

Power consumption of various parts of a laptop computer
CH1.67
Power management (2)

The use of zones for backlighting the display
CH1.68

Running at full clock speed Cutting voltage by two cuts clock speed by two, cuts power by four
CH1.69

Telling the programs to use less energy may mean poorer user experience
Examples change from color output to black and white speech recognition reduces vocabulary less resolution or detail in an image
CH1.70

09 Input Output

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

09 Input Output

Загружено:

Авторское право:

Доступные форматы

Chapter 9: Input/Output

Operating System Course

Principles of I/O Hardware

Some typical device, network, and data base rates

Memory-Mapped I/O (1)

Separate I/O and memory space Memory-mapped I/O Hybrid

Memory-Mapped I/O (2)

(a) A single-bus architecture (b) A dual-bus memory architecture

Direct Memory Access (DMA)

Operation of a DMA transfer

Principles of I/O Software

Goals of I/O Software (2)

Programmed I/O (1)

Steps in printing a string

Programmed I/O (2)

Writing a string to the printer using programmed I/O

I/O Using DMA

I/O Software Layers

Layers of the I/O Software System

Interrupt Handlers (1)

Interrupt handlers are best hidden

Interrupt procedure does its task

then unblocks driver that started it

Steps must be performed in software after interrupt completed

Interrupt Handlers (2)

Device-Independent I/O Software (1)

Uniform interfacing for device drivers Buffering

Functions of the device-independent I/O software

Device-Independent I/O Software (2)

Device-Independent I/O Software (3)s

Device-Independent I/O Software (4)

Networking may involve many copies

User-Space I/O Software

Disk Hardware (2)

Disk Hardware (3)

Raid levels 0 through 2 Backup and parity drives are shaded

Operating System Course

Operating System Course

Operating System Course

Operating System Course

Operating System Course

Operating System Course

Disk Hardware (4)

Raid levels 3 through 5 Backup and parity drives are shaded

Disk Hardware (5)

Recording structure of a CD or CD-ROM

Disk Hardware (6)

Logical data layout on a CD-ROM

Disk Hardware (7)

Disk Hardware (8)

A double sided, dual layer DVD disk

Disk Formatting (1)

Disk Formatting (2)

An illustration of cylinder skew

Disk Formatting (3)

No interleaving Single interleaving Double interleaving

Disk Arm Scheduling Algorithms (1)

Disk Arm Scheduling Algorithms (2)

Shortest Seek First (SSF) disk scheduling algorithm

Disk Arm Scheduling Algorithms (3)

The elevator algorithm for scheduling disk requests

Analysis of the influence of crashes on stable writes

Clock Software (1)