source: doc/theses/thierry_delisle_PhD/thesis/text/intro.tex @ 433e2c3

\chapter{Introduction}\label{intro}

\Gls{uthrding} (M:N) is gaining popularity over kernel-level threading (1:1) in many programming languages, like Go~\cite{GITHUB:go}, Java's Project Loom~\cite{MAN:project-loom} and Kotlin~\cite{MAN:kotlin}.
The user threading approach is often a better mechanism to express complex concurrent applications by efficiently running 10,000+ threads on multicore systems.
Indeed, over-partitioning into small work units with user threading significantly eases load bal\-ancing, while simultaneously providing advanced synchronization and mutual exclusion capabilities.
To manage these high levels of concurrency, the underlying runtime must efficiently schedule many user threads across a few kernel threads;
which raises the question of how many kernel threads are needed and should the number be dynamically reevaluated.
Furthermore, scheduling must prevent kernel threads from blocking, otherwise user-thread parallelism drops.
When user-threading parallelism does drop, how and when should idle kernel-threads be put to sleep to avoid wasting CPU resources?
Finally, the scheduling system must provide fairness to prevent a user thread from monopolizing a kernel thread;
otherwise, other user threads can experience short/long term starvation or kernel threads can deadlock waiting for events to occur on busy kernel threads.

This thesis analyzes multiple scheduler systems, where each system attempts to fulfill the requirements for \gls{uthrding}.
The predominant technique for managing high levels of concurrency is sharding the ready queue with one queue per kernel thread and using some form of work stealing/sharing to dynamically rebalance workload shifts.
Preventing kernel blocking is accomplished by transforming kernel locks and I/O operations into user-level operations that do not block the kernel thread or spin up new kernel threads to manage the blocking.
Fairness is handled through preemption and/or ad hoc solutions, which leads to coarse-grained fairness with some pathological cases.

After examining, testing and selecting specific approaches to these scheduling issues, a new scheduler was created and tested in the \CFA (C-for-all) user-threading runtime system.
The goal of the new scheduler is to offer increased safety and productivity without sacrificing performance.
The quality of the new scheduler is demonstrated by comparing it with other user-threading work-stealing schedulers with the aim of showing equivalent or better performance while offering better fairness.

Chapter~\ref{intro} defines scheduling and its general goals.
Chapter~\ref{existing} discusses how scheduler implementations attempt to achieve these goals, but all implementations optimize some workloads better than others.
Chapter~\ref{cfaruntime} presents the relevant aspects of the \CFA runtime system that have a significant effect on the new scheduler design and implementation.
Chapter~\ref{core} analyses different scheduler approaches while looking for scheduler mechanisms that provide both performance and fairness.
Chapter~\ref{userio} covers the complex mechanisms that must be used to achieve nonblocking I/O to prevent the blocking of \glspl{kthrd}.
Chapter~\ref{practice} presents the mechanisms needed to adjust the amount of parallelism, both manually and automatically.
Chapters~\ref{microbench} and~\ref{macrobench} present micro and macro benchmarks used to evaluate and compare the new scheduler with similar schedulers.


\section{Scheduling}\label{sched}
Computer systems share multiple resources across many threads of execution, even on single-user computers like laptops or smartphones.
On a computer system with multiple processors and work units (routines, coroutines, threads, programs, \etc), there exists the problem of mapping many different kinds of work units onto many different kinds of processors efficiently, called \newterm{scheduling}.
Scheduling systems are normally \newterm{open}, meaning new work arrives from an external source or is randomly spawned from an existing work unit\footnote{
Open systems constrasts to \newterm{closed} systems, where work never arrives from external sources.
This definition is a extension of open/closed systems in the field of thermodynamics.
}.

In general, work units without threads, like routines and coroutines, are self-scheduling, while work units with threads, like tasks and programs, are scheduled.
For scheduled work-units, a scheduler takes a sequence of threads and attempts to run them to completion, subject to shared resource restrictions and utilization.
In an open system, a general-purpose dynamic scheduler cannot anticipate work requests, so its performance is rarely optimal.
Even with complete knowledge of arrival order and work, creating an optimal solution is a bin packing problem~\cite{wiki:binpak}.
However, optimal solutions are often not required: schedulers often produce excellent solutions, without needing optimality, by taking advantage of regularities in work patterns.

Scheduling occurs at discrete points when there are transitions in a system.
For example, a \at cycles through the following transitions during its execution.
\begin{center}
\input{executionStates.pstex_t}
\end{center}
These \newterm{state transition}s are initiated in response to events, \eg blocking, interrupts, errors:
\begin{itemize}
\item
entering the system (new $\rightarrow$ ready)
\item
scheduler assigns a \at to a computing resource, \eg CPU (ready $\rightarrow$ running)
\item
timer alarm for preemption (running $\rightarrow$ ready)
\item
long-term delay versus spinning (running $\rightarrow$ blocked)
\item
completion of delay, \eg network or I/O completion (blocked $\rightarrow$ ready)
\item
normal completion or error, \eg segment fault (running $\rightarrow$ halted)
\end{itemize}
Key to scheduling is that a \at cannot bypass the ``ready'' state during a transition so the scheduler maintains complete control of the system, \ie no self-scheduling among threads.

When the workload exceeds the capacity of the processors, \ie work cannot be executed immediately, it is placed on a queue for subsequent service, called a \newterm{ready queue}.
Ready queues organize threads for scheduling, which indirectly organizes the work to be performed.
The structure of ready queues can take many different forms, where the basic two are the single-queue multi-server (SQMS) and the multi-queue multi-server (MQMS).
\begin{center}
\begin{tabular}{l|l}
\multicolumn{1}{c|}{\textbf{SQMS}} & \multicolumn{1}{c}{\textbf{MQMS}} \\
\hline
\raisebox{0.5\totalheight}{\input{SQMS.pstex_t}} & \input{MQMSG.pstex_t}
\end{tabular}
\end{center}
Beyond these two schedulers are a host of options, \eg adding a global shared queue to MQMS or adding multiple private queues with distinct characteristics.

Once there are multiple resources and ready queues, a scheduler is faced with three major optimization criteria:
\begin{enumerate}[leftmargin=*]
\item
\newterm{load balancing}: available work is distributed so no processor is idle when work is available.

\noindent
Eventual progress for each work unit is often an important consideration, \ie no starvation.
\item
\newterm{affinity}: processors access state through a complex memory hierarchy, so it is advantageous to keep a work unit's state on a single or closely bound set of processors.

\noindent
Essentially, all multiprocessor computers have non-uniform memory access (NUMA), with one or more quantized steps to access data at different levels in the memory hierarchy.
When a system has a large number of independently executing threads, affinity becomes difficult because of \newterm{thread churn}.
That is, threads must be scheduled on different processors to obtain high processor utilization because the number of threads $\ggg$ processors.

\item
\newterm{contention}: safe access of shared objects by multiple processors requires mutual exclusion in some form, generally locking.\footnote{
Lock-free data-structures do not involve locking but incur similar costs to achieve mutual exclusion.}
Mutual exclusion cost and latency increase significantly with the number of processors access\-ing a shared object.
\end{enumerate}

At a high-level, scheduling is considered zero-sum game as computer processors normally have a fixed, maximum number of cycles per unit time.\footnote{
Frequency scaling and turbo-boost add a degree of complexity that can be ignored in this discussion without loss of generality.}
This almost invariably leads to schedulers needing to pick some \ats over others, opening the door to fairness problems.
However, at a lower-level, schedulers can make inefficient or incorrect decisions leading to strictly worse outcomes than what the theoretical zero-sum game suggests.
Since it can be difficult to avoid these poor decisions, schedulers are generally a series of compromises, occasionally with some static or dynamic tuning parameters to enhance specific workload patterns.
For example, SQMS has perfect load-balancing but poor affinity and high contention by the processors, because of the single queue.
While MQMS has poor load-balancing but perfect affinity and no contention, because each processor has its own queue.

Significant research effort has looked at load balancing by stealing/sharing work units among queues: when a ready queue is too short or long, respectively, load stealing/sharing schedulers attempt to push/pull work units to/from other ready queues.
These approaches attempt to perform better load-balancing at the cost of affinity and contention.
However, \emph{all} approaches come at a cost, but not all compromises are necessarily equivalent, especially across workloads.
Hence, some schedulers perform very well for specific workloads, while others offer acceptable performance over a wider range of workloads.

\section{\CFA programming language}

The \CFA programming language~\cite{Cforall,Moss18} extends the C programming language by adding modern safety and productivity features, while maintaining backwards compatibility.
Among its productivity features, \CFA supports \gls{uthrding}~\cite{Delisle21} as its fundamental threading model allowing programmers to easily write modern concurrent and parallel programs.
My previous master's thesis on concurrency in \CFA focused on features and interfaces~\cite{Delisle18}.
This Ph.D.\ thesis focuses on performance, introducing \glsxtrshort{api} changes only when required by performance considerations.
Specifically, this work concentrates on advanced thread and \glsxtrshort{io} scheduling.
Prior to this work, the \CFA runtime used a strict SQMS \gls{rQ} and provided no nonblocking \glsxtrshort{io} capabilities at the user-thread level.\footnote{
C/\CC only support \glsxtrshort{io} capabilities at the kernel level, which means many \io operations block \glspl{kthrd}, reducing parallelism at the user level.}

Since \CFA attempts to improve the safety and productivity of C, the new scheduler presented in this thesis attempts to achieve the same goals.
More specifically, safety and productivity for scheduling mean supporting a wide range of workloads, so that programmers can rely on progress guarantees (safety) and more easily achieve acceptable performance (productivity).
The new scheduler also includes support for implicit nonblocking \io, allowing applications to have more user-threads blocking on \io operations than there are \glspl{kthrd}.
To complete the scheduler, an idle sleep mechanism is implemented that significantly reduces wasted CPU cycles, which are then available outside the application.

As a research project, this work runs exclusively on newer versions of the Linux operating system and gcc/clang compilers.
The new scheduler implementation uses several optimizations to successfully balance the cost of fairness against performance;
some of these optimizations rely on interesting hardware optimizations only present on modern CPUs.
The \io implementation is based on the @io_uring@ kernel interface, a recent addition to the Linux kernel, because it purports to handle nonblocking \emph{file} and network \io.
This decision allowed an interesting performance and fairness comparison with other threading systems using @select@, @epoll@, \etc.
While the current \CFA release supports older versions of Linux ($\ge$~Ubuntu 16.04) and gcc/clang compilers ($\ge$~gcc 6.0), it is not the purpose of this project to find workarounds in these older systems to provide backwards compatibility.
The hope is that these new features will soon become mainstream features.

\section{Contributions}\label{s:Contributions}
This work provides the following scheduling contributions for advanced \gls{uthrding} runtime systems:
\begin{enumerate}[leftmargin=*]
\item
A scalable scheduling algorithm that offers progress guarantees.
\item
Support for user-level \glsxtrshort{io} capabilities based on Linux's @io_uring@.
\item
An algorithm for load-balancing and idle sleep of processors, including NUMA awareness.
\item
A mechanism for adding fairness on top of the MQMS algorithm through helping, used both for scalable scheduling algorithm and the user-level \glsxtrshort{io}.
\item
An optimization of the helping mechanism for load balancing to reduce scheduling costs.
\item
An optimization for the alternative relaxed-list for load balancing to reduce scheduling costs in embarrassingly parallel cases.
\end{enumerate}