Editing O(1) scheduler (section)

== Improvement in Linux scheduler performance ==
The Linux 2.6.8.1 scheduler did not contain any algorithms that run in worse than O(1) time.<ref>{{cite web
|author = Josh Aas
|url = https://github.com/bdaehlie/linux-cpu-scheduler-docs/blob/master/linux_cpu_scheduler.pdf
|title = Understanding the Linux 2.6.8.1 CPU Scheduler
|website = [[GitHub]]
|access-date = 2014-09-09
}}</ref> That is, every part of the scheduler is guaranteed to execute within a certain constant amount of time regardless of how many tasks are on the system. This allows the [[Linux kernel]] to efficiently handle massive numbers of tasks without increasing overhead costs as the number of tasks grows. There are two key data structures in the Linux 2.6.8.1 scheduler that allow for it to perform its duties in O(1) time, and its design revolves around them: [[run queue|runqueues]] and priority arrays.