Modified First Come First Serve (MFCFS)

Disk scheduling requires a careful scrutinization of the requests which are pending in order to determine the most efficient way to serve the requests. There are two most common type of disk scheduling i.e. seek optimization and latency (or rotational) optimization. Each and every scheduling algorithm focuses on reducing the seek time for the pending requests, since seek time in order of magnitude is greater than latency time. Seek time calculates the time required for read/write heads to move between the tracks provided by the disk.

Provided by: Institute of Research and Journals (IRAJ) Topic: Software Date Added: Nov 2014 Format: PDF

Find By Topic