Unit-4th DEVICE MANAGEMENTDr. Dheerendra Singh Professor & Head Computer Science & Engineering Department

Direct Memory AccessUsed to avoid programmed I/O for large data movement Requires DMA controller Bypasses CPU to transfer data directly between I/O device and memory

Six Step Process to Perform DMA Transfer

Application I/O InterfaceI/O system calls encapsulate device behaviors in generic classesDevice-driver layer hides differences among I/O controllers from kernelDevices vary in many dimensionsCharacter-stream or blockSequential or random-accessSharable or dedicatedSpeed of operationread-write, read only, or write only

Block and Character DevicesBlock devices include disk drivesCommands include read, write, seek Raw I/O or file-system accessMemory-mapped file access possible Character devices include keyboards, mice, serial portsCommands include get, putLibraries layered on top allow line editing

Network DevicesVarying enough from block and character to have own interface Unix and Windows NT/9i/2000 include socket interfaceSeparates network protocol from network operationIncludes select functionality Approaches vary widely (pipes, FIFOs, streams, queues, mailboxes)

Clocks and TimersProvide current time, elapsed time, timer If programmable interval time used for timings, periodic interrupts ioctl (on UNIX) covers odd aspects of I/O such as clocks and timers

Blocking and Nonblocking I/OBlocking - process suspended until I/O completedEasy to use and understandInsufficient for some needs Nonblocking - I/O call returns as much as availableUser interface, data copy (buffered I/O)Implemented via multi-threadingReturns quickly with count of bytes read or written Asynchronous - process runs while I/O executesDifficult to useI/O subsystem signals process when I/O completed

Error HandlingOS can recover from disk read, device unavailable, transient write failures Most return an error number or code when I/O request fails System error logs hold problem reports

STREAMSSTREAM a full-duplex communication channel between a user-level process and a device

A STREAM consists of:- STREAM head interfaces with the user process- driver end interfaces with the device - zero or more STREAM modules between them.

Each module contains a read queue and a write queue

Message passing is used to communicate between queues

Disk StructureDisk drives are addressed as large 1-dimensional arrays of logical blocks, where the logical block is the smallest unit of transfer. The 1-dimensional array of logical blocks is mapped into the sectors of the disk sequentially.Sector 0 is the first sector of the first track on the outermost cylinder.Mapping proceeds in order through that track, then the rest of the tracks in that cylinder, and then through the rest of the cylinders from outermost to innermost.

Disk SchedulingThe operating system is responsible for using hardware efficiently for the disk drives, this means having a fast access time and disk bandwidth.Access time has two major componentsSeek time is the time for the disk are to move the heads to the cylinder containing the desired sector.Rotational latency is the additional time waiting for the disk to rotate the desired sector to the disk head.Minimize seek timeSeek time seek distanceDisk bandwidth is the total number of bytes transferred, divided by the total time between the first request for service and the completion of the last transfer.

Disk Scheduling Several algorithms exist to schedule the servicing of disk I/O requests. In all algorithms a request queue (0-199) is taken as an example. 98, 183, 37, 122, 14, 124, 65, 67

In all examples, Head pointer starts at 53

FCFSFig shows total head movement of 640 cylinders.

SSTF

SHORTEST SEEK TIME FIRSTSelects the request with the minimum seek time from the current head position.SSTF scheduling is a form of SJF scheduling; may cause starvation of some requests.Fig shows total head movement of 236 cylinders.

SSTF (Cont.)

SCANThe disk arm starts at one end of the disk, and moves toward the other end, servicing requests until it gets to the other end of the disk, where the head movement is reversed and servicing continues.Sometimes called the elevator algorithm.Fig shows total head movement of 208 cylinders.

SCAN

C-SCANProvides a more uniform wait time than SCAN.The head moves from one end of the disk to the other. servicing requests as it goes. When it reaches the other end, however, it immediately returns to the beginning of the disk, without servicing any requests on the return trip.Treats the cylinders as a circular list that wraps around from the last cylinder to the first one.

C-SCAN

C-LOOKVersion of C-SCANArm only goes as far as the last request in each direction, then reverses direction immediately, without first going all the way to the end of the disk.

C-LOOK

END

*