[PATCH] docs: scheduler: remove extra whitespace in

[Wojciech S.]

Signed-off-by: Wojciech S. <wojciech.develop@xxxxxxxxx>
---
 Documentation/scheduler/sched-deadline.rst | 2 +-
 Documentation/scheduler/sched-debug.rst    | 8 ++++----
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/Documentation/scheduler/sched-deadline.rst
b/Documentation/scheduler/sched-deadline.rst
index ec543a12f..87f8baa14 100644
--- a/Documentation/scheduler/sched-deadline.rst
+++ b/Documentation/scheduler/sched-deadline.rst
@@ -54,7 +54,7 @@ Deadline Task Scheduling
  "deadline", to schedule tasks. A SCHED_DEADLINE task should receive
  "runtime" microseconds of execution time every "period" microseconds, and
  these "runtime" microseconds are available within "deadline" microseconds
- from the beginning of the period.  In order to implement this behavior,
+ from the beginning of the period. In order to implement this behavior,
  every time the task wakes up, the scheduler computes a "scheduling deadline"
  consistent with the guarantee (using the CBS[2,3] algorithm). Tasks are then
  scheduled using EDF[1] on these scheduling deadlines (the task with the
diff --git a/Documentation/scheduler/sched-debug.rst
b/Documentation/scheduler/sched-debug.rst
index b5a92a39e..ea874690b 100644
--- a/Documentation/scheduler/sched-debug.rst
+++ b/Documentation/scheduler/sched-debug.rst
@@ -10,7 +10,7 @@ numa_balancing
 ==============

 `numa_balancing` directory is used to hold files to control NUMA
-balancing feature.  If the system overhead from the feature is too
+balancing feature. If the system overhead from the feature is too
 high then the rate the kernel samples for NUMA hinting faults may be
 controlled by the `scan_period_min_ms, scan_delay_ms,
 scan_period_max_ms, scan_size_mb` files.
@@ -21,15 +21,15 @@ scan_period_min_ms, scan_delay_ms,
scan_period_max_ms, scan_size_mb

 Automatic NUMA balancing scans tasks address space and unmaps pages to
 detect if pages are properly placed or if the data should be migrated to a
-memory node local to where the task is running.  Every "scan delay" the task
+memory node local to where the task is running. Every "scan delay" the task
 scans the next "scan size" number of pages in its address space. When the
 end of the address space is reached the scanner restarts from the beginning.

 In combination, the "scan delay" and "scan size" determine the scan rate.
-When "scan delay" decreases, the scan rate increases.  The scan delay and
+When "scan delay" decreases, the scan rate increases. The scan delay and
 hence the scan rate of every task is adaptive and depends on historical
 behaviour. If pages are properly placed then the scan delay increases,
-otherwise the scan delay decreases.  The "scan size" is not adaptive but
+otherwise the scan delay decreases. The "scan size" is not adaptive but
 the higher the "scan size", the higher the scan rate.

 Higher scan rates incur higher system overhead as page faults must be
-- 
2.47.3