Editing O(1) scheduler (section)

== Issues ==
The main issue with this algorithm is the complex heuristics used to mark a task as [[interactive computing|interactive]] or non-interactive. The algorithm tries to identify interactive processes by analyzing average sleep time (the amount of time the process spends waiting for input). Processes that sleep for long periods of time probably are waiting for user input, so the scheduler assumes they're interactive. The scheduler gives a priority bonus to interactive tasks (for better throughput) while penalizing non-interactive tasks by lowering their priorities. All the calculations to determine the interactivity of tasks are complex and subject to potential miscalculations,{{citation needed|date=July 2016}} causing non-interactive behavior from an interactive process.