The simplest form of disk scheduling is, of course, the first-come, first-served(FCFS) algorithm. This algorithm is intrinsically fair, but it generally does notprovide the fastest service. Consider, for example, a disk queue with requestsfor I/O to blocks on cylinders
đang được dịch, vui lòng đợi..
