What scheduling algorithms does Linux kernel use?
Asked Answered
V

8

20

What scheduling algorithms does Linux kernel use?

Where can I get more info about linux's kernel? (OS first course... student level)

Vertical answered 21/10, 2009 at 20:18 Comment(3)
Do you mean the "scheduling algorithm the Linux kernel uses"?Intrusive
mm maybe, my english is not good. I mean, FCFS, round robin or what uses the linux kernel to handle the processes.Vertical
It's a little old, but try reading this page. (This was previously posted as a separate answer, which received 4 upvotes. Unfortunately, it seems this site's policy towards such useful answers, even ones which have helped people for 7 years, is that they should be deleted...)Ulmaceous
T
7

The linux kernel has several different available scheduling algorithms both for the process scheduling and for I/O scheduling. Download it from www.kernel.org and call

make menuconfig

You will get a full list of all available options with a built-in help. One guy that once came up with his O(1) scheduler is Con Kolivas. Definitively have to have a look at what he did. I was once a great break-through.

Teasel answered 21/10, 2009 at 20:25 Comment(1)
It would be nice if you can please mention the category in menuconfig that the schedulers can be found.Dumpling
R
7

Note: As Abdullah Shahin noted, this answer is about IO queing scheduler, not for processes.

If you just want to check what scheduler your linux system is using and which are available you can run the following command:

cat /sys/block/sda/queue/scheduler

The one between the [] is the one it's using at the moment. The other ones are available. To change it:

sudo bash -c 'echo deadline > /sys/block/sda/queue/scheduler'

Be carefull to set it back to default though, unless you know what you are doing and want.

Default (in newer Ubuntu distros at least) is CFQ (Completely Fair Scheduling):

http://en.wikipedia.org/wiki/CFQ

Interview with the creator (Jens Axboe):

http://kerneltrap.org/node/7637

Recurrence answered 2/6, 2013 at 20:8 Comment(1)
for the record, this is a completely misleading answer, should have included in the answer that this is an io queuing scheduler, not for processes, in systems that use SSDs this won't be enabled at all, and it will show [none] in designated files.Buddle
B
2

As others have already mentioned, there are several scheduling algorithms available, according to the intended use.

Check this article if you want to learn more about scheduling in Linux.

Beggary answered 21/10, 2009 at 20:31 Comment(0)
C
1

i believe "completely fair scheduler" is in use with latest kernels. I think you can good amount of information if you just search for it in google.

link : http://en.wikipedia.org/wiki/Completely_Fair_Scheduler

Cheroot answered 21/10, 2009 at 20:25 Comment(0)
T
1

A new addition to Linux Kernel is EDF (Earliest Deadline First) for guaranteed RealTime support http://lkml.org/lkml/2009/9/22/186 http://www.evidence.eu.com/content/view/313/390/

Tsuda answered 22/10, 2009 at 17:42 Comment(0)
S
0

I think the Linux kernel actually has a few different schedulers you can choose from at compile-time. To find out more about the Linux kernel, you can download the kernel source code (or browse it online) and look in the Documentation directory. For example, the scheduler subdirectory might be helpful. You can also just look at the code itself, obviously.

Specs answered 21/10, 2009 at 20:27 Comment(1)
The IO scheduler has different algorithms. The process scheduler does not.Detrimental
H
0

Modern GNU/Linux distributions use CFS (Completely Fair Scheduler). You may read more on that in the 4th chapter of this book: Linux Kernel Development 3rd Edition by Robert Love

You will find many interesting and easy to understand explanations there. I enjoyed a lot.

Henriquez answered 23/4, 2019 at 21:6 Comment(0)
P
-1

Linux Kernel allows three different scheduling algorithms mainly

  1. shortest job first
  2. Round Robin Scheduling
  3. Priority based preemptive scheduling algorithm.

The third scheduling method which it differs with lower version of Linux versions such as 2.4

Perrotta answered 26/10, 2010 at 5:4 Comment(3)
how can it do SJF with out knowing duration of jobs before hand?Process
@Process It observes their past behaviours and move them up and down in the priority queues accordingly.Crossed
The answer is very basic. U need to get a better look and detailed study on latest kernel versionDamascus

© 2022 - 2024 — McMap. All rights reserved.