Explain various Non-preemptive Scheduling Mechanisms.

Someone provide the various Non-preemptive Scheduling Mechanisms?
Add a comment

6 replies

"The rapid growth of the Internet will result in an increased demand for higher transmission rates and faster switching technologies. In order to efficiently utilize the amount of raw bandwidth in WDM networks, an all-optical transport method, which avoids electronic buffering while handling bursty traffic, must be developed. Optical burst-switching (OBS) is one such method for transporting traffic directly over a bufferless WDM network"
Add a comment
"To understand the concept of preemptive and non preemptive scheduling, it is necessary to mention the circumstances under which CPU scheduling decisions may take place. These four circumstances are given below. (1) When a process enter into waiting state from the running state. (2) When a process enter into the ready state from the waiting state. (3) When a process enter into the ready state from the running state. (4) When a process terminates."
Add a comment
"Non-Preemptive Scheduling Mechanisms are of four types :- (1) First Come First Served (FCFS) Scheduling : With this scheme, the process that requests the CPU first is allocated the CPU first. (2) Shortest-Job First (SJF) Scheduling : In this scheme, job requiring the minimal CPU time is selected first for CPU allocation. (3) Priority Scheduling : In this scheme a priority is associated with each process and the CPU is allocated to the process with the highest priority. (4) Deadline Scheduling : With this scheduling algorithm the process with earliest deadline is given the highest priority for execution. Source: http://in.docsity.com/en-docs/Fundamentals_of_Operating_Systems__Lecture_notes__Poonam_Sharma"
Add a comment