From 75f10f028f79b12e1d40634edc54c505a9ee14e4 Mon Sep 17 00:00:00 2001 From: Con Kolivas Date: Mon, 17 Oct 2016 17:07:31 +1100 Subject: [PATCH 51/80] Typo --- Documentation/scheduler/sched-MuQSS.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/Documentation/scheduler/sched-MuQSS.txt b/Documentation/scheduler/sched-MuQSS.txt index c0841e2..2521d1a 100644 --- a/Documentation/scheduler/sched-MuQSS.txt +++ b/Documentation/scheduler/sched-MuQSS.txt @@ -33,7 +33,7 @@ need to scan the entire runqueue looking for the process with the earliest deadline and schedule that next, regardless of which CPU it originally came from. This made BFS deterministic with respect to latency and provided guaranteed latencies dependent on number of processes and CPUs. The single -runqueue, however, meant that all CPUs would complete for the single lock +runqueue, however, meant that all CPUs would compete for the single lock protecting it, which would lead to increasing lock contention as the number of CPUs rose and appeared to limit scalability of common workloads beyond 16 logical CPUs. Additionally, the O(n) lookup of the runqueue list obviously -- 2.7.4