2080.1 1

Operating Systems2080.110 marksNumerical: Disk scheduling algorithmsVideo solutionDMA Operation

How DMA operation is performed? Consider a disk with 200 tracks and the queue has random requests from different processes in the order: 45, 48, 29, 17, 80, 150, 28 and 188. Find the seek time using FIFO, SSTF and SCAN. Assume the initial position of head as 100.

How DMA operation is performed? Consider a disk with 200 tracks and the queue has random requests from different processes in the order: 45, 48, 29, 17, 80, 150, 28 and 188. Find the seek time using FIFO, SSTF and SCAN. Assume the initial position of head as 100.[10]

Video solutionDMA Operation and Disk Scheduling: FIFO, SSTF, SCAN2:15
Speed

Checked against the model answer before publishing.

  • Total tracks: 200 (numbered 0 to 199) - Request queue (in order): 45, 48, 29, 17, 80, 150, 28, 188 - Initial head position: 100 --- Direct Memory Access (DMA) is an I/O technique in which a dedicated hardware controller transfers data directly between an I/O device and main memory, freeing the ...
Up nextHow do you distinguish between deadlock and starvation? Describe. Explain working mechanis