Linux usually uses a pre-emptive scheduler, which means a process will run until either it makes a system call, or its time slice runs out. This is as opposed to a cooperative scheduler, which allows a process to run until it deems itself ready to go from running to ready state.
Needless to say, preemption is a much better model, keeping misbehaving processes from starving other processes of CPU time.
there are 3 algorithms used in linux
1.first in first out
2.priority
3.round robin
according to the type of process one of the above will be taken.
Linux uses the Completely Fair Scheduler by default.
mix of two or three maybe round robin,SJF with priority
Priority fair scheduling
Priority fair scheduling
Thread Based
same as linux use.
scheduling algorithm
The priority scheduling algorithm is a kind of CPU scheduling algorithm where the processes that wait for the CPU are scheduled according to their priority..
Windows XP uses a quantum-based, preemptive priority scheduling algorithm
The Least Slack Time scheduling algorithm is used for assigning priority based on the slack time (temporal difference between the deadline, ready time and run time) of a process.
Priority based algorithm
Several operating systems are capable of functioning in a distributed manner, including Linux, FreeBSD, Solaris, and Mac OS X.
In Linux you have Cron which manages most of the scheduling. Of course if you mean scheduling that happens when a user shutdown or starts up a computer you would be talking about init which is the first program started when booting Linux. Alternatively you could use another scheduler such as atd if you are used to an UNIX like scheduler system.
Linux project management software is used to manage many aspects of a specific project, like finances, quality management, and scheduling. It is used to plan and control resources for the project.
Yes, it is one of many scheduling algorithms suitable for time sharing.However it is not suitable for scheduling in a hard realtime OS that must consistently meet deadlines.
its the algorithm that tells the os what to process next.goes according to :shortest job firstshortest remaining time firstround robin- first in first out system
-20