Since the currently executing process is the one with the shortest amount of time remaining by definition, and since that time should only reduce as execution progresses, processes will always run until they complete or a new process is added that requires a smaller amount of time.Tutorialspoint.dev Copyright 2019.
This work is licensed under Creative Common Attribution-ShareAlike 4.0 International. ![]() In this algorithm, the CPU is allocated to the processes in the order they request it. The implementation of FCFS is easily done with a queue (a FIFO structure). As other processes enter the system, they are put at the end of the queue and wait to get the CPU. When a process finishes executing, it releases the CPU, is removed from the queue and the CPU is allocated to next process at the head of the queue. Thus, it is not suitable for modern systems which work on the principle of time sharing. STUDENTS SECTION Internship Certificates Content Writers of the Month.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |