I/O Management and Disk Scheduling
description
Transcript of I/O Management and Disk Scheduling
![Page 1: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/1.jpg)
I/O Management and Disk Scheduling
Chapter 11
![Page 2: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/2.jpg)
Categories of I/O Devices
• Human readable
• Machine readable
• Communication
![Page 3: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/3.jpg)
Categories of I/O Devices
• Human readable– Used to communicate with the user– Printers– Video display terminals
• Display
• Keyboard
• Mouse
![Page 4: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/4.jpg)
Categories of I/O Devices
• Machine readable– Used to communicate with electronic
equipment– Disk and tap drives– Sensors– Controllers– Actuators
![Page 5: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/5.jpg)
Categories of I/O Devices
• Communication– Used to communicate with remote devices– Digital line drivers– Modems
![Page 6: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/6.jpg)
Differences in I/O Devices
• Data rate
• Application
• Complexity of control
• Unit of transfer
• Data representation
• Error conditions
![Page 7: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/7.jpg)
Techniques for Performing I/O
• Programmed I/O
– Process is busy-waiting for the operation to complete
• Interrupt-driven I/O
– I/O command is issued
– Processor continues executing instructions
– I/O module sends an interrupt when done
• Direct Memory Access (DMA)
– DMA module controls exchange of data between main memory and the I/O device
– Processor interrupted only after entire block has been transferred
![Page 8: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/8.jpg)
Evolution of the I/O Function
• Processor directly controls a peripheral device
• Controller or I/O module is added– Processor uses programmed I/O without
interrupts– Processor does not need to handle details of
external devices
![Page 9: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/9.jpg)
Evolution of the I/O Function
• Controller or I/O module with interrupts– Processor does not spend time waiting for
an I/O operation to be performed
• Direct Memory Access– Blocks of data are moved into memory
without involving the processor– Processor involved at beginning and end
only
![Page 10: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/10.jpg)
Evolution of the I/O Function
• I/O module is a separate processor
• I/O processor - a computer in its own right– I/O module has its own local memory– Its a computer in its own right
![Page 11: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/11.jpg)
Direct Memory Access
• Takes control of the system form the CPU to transfer data to and from memory over the system bus
• Cycle stealing is used to transfer data on the system bus
• The instruction cycle is suspended so data can be transferred
• The CPU pauses one bus cycle• No interrupts occur
– Do not save context
![Page 12: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/12.jpg)
DMA
![Page 13: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/13.jpg)
![Page 14: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/14.jpg)
DMA
• Problems and solutions
• Cycle stealing causes the CPU to execute more slowly
• Number of required busy cycles can be cut by integrating the DMA and I/O functions
• Path between DMA module and I/O module that does not include the system bus
![Page 15: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/15.jpg)
DMA
![Page 16: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/16.jpg)
DMA
![Page 17: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/17.jpg)
DMA
![Page 18: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/18.jpg)
Operating System Design Issues
• Efficiency– Most I/O devices extremely slow – Use of multiprogramming allows for some
processes to be waiting on I/O while another process executes
• Generality– Desirable to handle all I/O devices in a uniform
manner– Hide most of the details of device I/O in lower-level
routines so that processes and upper levels see devices in general terms such as read, write, open, close, lock, unlock
![Page 19: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/19.jpg)
Logical structure
• Hierarchical philosophy
• the functions of the OS should be organized in layers, according to their
• complexity
• characteristic time scale
• level of abstraction
![Page 20: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/20.jpg)
Local peripheral device layers
– Logical I/O: deals with the device as a logical resource, not concerned with the details of actually controlling the device.
– Device I/O: requested operations and data are converted into appropriate sequences of I/O instructions, channel commands, and controller orders.
– Scheduling and controls: the actual queuing and scheduling of I/O operations occurs at this layer, as well as the control of the operations.
![Page 21: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/21.jpg)
![Page 22: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/22.jpg)
I/O Buffering
• Reasons for buffering– Processes must wait for I/O to complete
before proceeding– Certain pages must remain in main memory
during I/O
![Page 23: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/23.jpg)
I/O Buffering
• Block-oriented
– Information is stored in fixed sized blocks
– Transfers are made a block at a time
– Used for disks and tapes
• Stream-oriented
– Transfer information as a stream of bytes
– Used for terminals, printers, communication ports, mouse, and most other devices that are not secondary storage
![Page 24: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/24.jpg)
Single Buffer
• Operating system assigns a buffer in main memory for an I/O request
• Block-oriented– Input transfers made to buffer– Block moved to user space when needed– Another block is moved into the buffer
• Read ahead
![Page 25: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/25.jpg)
I/O Buffering
![Page 26: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/26.jpg)
Single Buffer
• Block-oriented– User process can process one block of data
while next block is read in– Swapping can occur since input is taking
place in system memory, not user memory– Operating system keeps track of assignment
of system buffers to user processes
![Page 27: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/27.jpg)
Single Buffer
• Stream-oriented– Used a line at time– User input from a terminal is one line at a
time with carriage return signaling the end of the line
– Output to the terminal is one line at a time
![Page 28: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/28.jpg)
Double Buffer
• Use two system buffers instead of one
• A process can transfer data to or from one buffer while the operating system empties or fills the other buffer
![Page 29: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/29.jpg)
Circular Buffer
• More than two buffers are used
• Each individual buffer is one unit in a circular buffer
• Used when I/O operation must keep up with process
![Page 30: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/30.jpg)
I/O Buffering
![Page 31: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/31.jpg)
Utility of Buffering
• Buffering smooths out peaks in I/O demand
• can increase the efficiency of the operating system and the performance of individual processes.
![Page 32: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/32.jpg)
Disk Scheduling
• To read or write, the disk head must be positioned at the desired track and at the beginning of the desired sector
• Aim of Scheduling:• minimize the access time:
• seek time• rotational delay
![Page 33: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/33.jpg)
Disk Performance Parameters
• Seek time– time it takes to position the head at the
desired track
• Rotational delay or rotational latency– time its takes for the beginning of the
sector to reach the head
![Page 34: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/34.jpg)
Timing of a Disk I/O Transfer
![Page 35: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/35.jpg)
Disk Performance Parameters
• Access time– Sum of seek time and rotational delay– The time it takes to get in position to read
or write
• Data transfer occurs as the sector moves under the head
![Page 36: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/36.jpg)
Disk Scheduling Policies
• Random scheduling– the worst possible performance
• First-in, first-out (FIFO)
• Priority
• Last-in, first-out
• Shortest Service Time First
• SCAN
• C-SCAN
![Page 37: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/37.jpg)
Disk Scheduling Policies
• First-in, first-out (FIFO)– Process request sequentially– Fair to all processes– Approaches random scheduling in
performance if there are many processes
![Page 38: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/38.jpg)
Disk Scheduling Policies
• Priority– Goal is not to optimize disk use but to meet
other objectives– Short batch jobs may have higher priority– Provide good interactive response time
![Page 39: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/39.jpg)
Disk Scheduling Policies
• Last-in, first-out– Good for transaction processing systems
• The device is given to the most recent user so there should be little arm movement
– Possibility of starvation since a job may never regain the head of the line
![Page 40: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/40.jpg)
Disk Scheduling Policies
• Shortest Service Time First– Select the disk I/O request that requires the
least movement of the disk arm from its current position
– Always choose the minimum Seek time
![Page 41: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/41.jpg)
Disk Scheduling Policies
• SCAN– Arm moves in one direction only, satisfying
all outstanding requests until it reaches the last track in that direction
– Direction is reversed
![Page 42: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/42.jpg)
Disk Scheduling Policies
• C-SCAN– Restricts scanning to one direction only– When the last track has been visited in one
direction, the arm is returned to the opposite end of the disk and the scan begins again
![Page 43: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/43.jpg)
Disk Scheduling Policies
• N-step-SCAN– Segments the disk request queue into
subqueues of length N– Subqueues are process one at a time, using
SCAN– New requests added to other queue when
queue is processed
• FSCAN– Two queues– One queue is empty for new request
![Page 44: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/44.jpg)
Disk Scheduling Algorithms
![Page 45: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/45.jpg)
RAIDRedundant Array of Independent Disks
RAID is a set of physical disk drives viewed by the operating system as a single logical drive.
Data are distributed across the physical drives of an array.
Redundant disk capacity is used to store parity information, which guarantees data recoverability in case of a disk failure.
![Page 46: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/46.jpg)
RAID
• Enables simultaneous access to data from multiple drives, thereby improving I/O performance and allowing easier incremental increases in capacity.
• Increased the probability of failure. RAID makes use of stored parity information that enables the recovery of data lost due to a disk failure.
![Page 47: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/47.jpg)
RAID
• RAID 0: the user and system data are distributed across all of the disks in the array. Parallel processing, non redundant.
• RAID 1: redundancy is achieved by mirroring the disks
• RAID 2 and 3: make use of a parallel access technique, all member disks participate in the execution of every I/O request.
![Page 48: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/48.jpg)
RAID
• RAID 2: redundancy through Humming code, not implemented
• RAID 3: a single redundant disk, bit-interleaved parity
• RAID 4: block-level parity
• RAID 5: block-level distributed parity
• RAID 6: dual redundancy
![Page 49: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/49.jpg)
RAID 0 (non-redundant)
![Page 50: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/50.jpg)
![Page 51: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/51.jpg)
RAID 1 (mirrored)
![Page 52: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/52.jpg)
RAID 2 (redundancy through Hamming code)
![Page 53: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/53.jpg)
RAID 3 (bit-interleaved parity)
![Page 54: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/54.jpg)
RAID 4 (block-level parity)
![Page 55: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/55.jpg)
RAID 5 (block-level distributed parity)
![Page 56: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/56.jpg)
RAID 6 (dual redundancy)
![Page 57: I/O Management and Disk Scheduling](https://reader036.fdocuments.in/reader036/viewer/2022062518/568142e5550346895daf4249/html5/thumbnails/57.jpg)
Disk Cache
• Buffer in main memory for disk sectors
• Contains a copy of some of the sectors on the disk
• Used to improve access time