It termed as First Come First Serve (FCFS) Scheduling. As its name implies, the process which arrives first in front of CPU for processing, then that process executed first. It is a non-preemptive scheduling algorithm which means in this priority of proc
M. Hofri, “Disk scheduling: FCFS vs. SSTF revisited,” Communications of the ACM , vol. 23, pp. 645–653, Nov. 1980... M Hofri - 《Communications of the Acm》 被引量: 0发表: 1980年 Proposed M. Sc. Syllabus directory structureUNIT IXDisk Management:disk structure, disk scheduling (...
Disk scheduling: FCFS vs SSTF revisitedCiteSeerX - Scientific documents that cite the following paper: Disk scheduling: FCFS vs SSTF revisitedCommunications of the Acm
According to the FCFS scheduling algorithm, the process comes the first CPU will execute that process first. So, here CPU will execute process P1. In this schedule, the average waiting time of the system will also be very high. This is because of the convoy effect or starvation. The other...
M. Hofri, “Disk scheduling: FCFS vs. SSTF revisited,” Communications of the ACM , vol. 23, pp. 645–653, Nov. 1980... M Hofri - 《Communications of the Acm》 被引量: 0发表: 1980年 Proposed M. Sc. Syllabus directory structureUNIT IXDisk Management:disk structure, disk scheduling (...