Context Navigation

-                      re9e3d02
+                      rfcfbc52
 \chapter{Macro-Benchmarks}\label{macrobench}
+The previous chapter has demonstrated that the scheduler achieves its performance goal in small and controlled scenario.
+The next step is then to demonstrate that this stays true in more realistic and complete scenarios.
+This chapter presents two flavours of webservers that demonstrate that \CFA performs competitively with production environments.
+Webservers where chosen because they offer fairly simple applications that are still useful as standalone products.
+Furthermore, webservers are generally amenable to parallelisation since their workloads are mostly homogenous.
+They therefore offer a stringent performance benchmark for \CFA.
+Indeed existing solutions are likely to have close to optimal performance while the homogeneity of the workloads mean the additional fairness is not needed.
+This means that there is very little room to use for the extra cost of fairness.
+As such, these experiements should highlight the fairness cost in realistic scenarios.
+The previous chapter demonstrated the \CFA scheduler achieves its equivalent performance goal in small and controlled \at-scheduling scenarios.
+The next step is to demonstrate performance stays true in more realistic and complete scenarios.
+Therefore, this chapter exercises both \at and I/O scheduling using two flavours of webservers that demonstrate \CFA performs competitively with production environments.
+Webservers are chosen because they offer fairly simple applications that perform complex I/O, both network and disk, and are useful as standalone products.
+Furthermore, webservers are generally amenable to parallelization since their workloads are mostly homogeneous.
+Therefore, webservers offer a stringent performance benchmark for \CFA.
+Indeed, existing webservers have close to optimal performance, while the homogeneity of the workload means fairness may not be a problem.
+As such, these experiments should highlight any \CFA fairness cost (overhead) in realistic scenarios.
 \section{Memcached}
 Memcached~\cite{memcached} is an in memory key-value store that is used in many production environments, \eg \cite{atikoglu2012workload}.
 This also server also has the notable added benefit that there exists a full-featured front-end for performance testing called @mutilate@~\cite{GITHUB:mutilate}.
 Experimenting on memcached allows for a simple test of the \CFA runtime as a whole, it will exercise the scheduler, the idle-sleep mechanism, as well the \io subsystem for sockets.
 Note that this experiment does not exercise the \io subsytem with regards to disk operations.
+Memcached~\cite{memcached} is an in-memory key-value store used in many production environments, \eg \cite{atikoglu2012workload}.
+In fact, the Memcached server is so popular there exists a full-featured front-end for performance testing, called @mutilate@~\cite{GITHUB:mutilate}.
+Experimenting on Memcached allows for a simple test of the \CFA runtime as a whole, exercising the scheduler, the idle-sleep mechanism, as well the \io subsystem for sockets.
+Note, this experiment does not exercise the \io subsystem with regards to disk operations because Memcached is an in-memory server.
 \subsection{Benchmark Environment}
+These experiments are run on a cluster of homogenous Supermicro SYS-6017R-TDF compute nodes with the following characteristics:
+The Memcached experiments are run on a cluster of homogeneous Supermicro SYS-6017R-TDF compute nodes with the following characteristics.
+\begin{itemize}
+\item
 The server runs Ubuntu 20.04.3 LTS on top of Linux Kernel 5.11.0-34.
+\item
 Each node has 2 Intel(R) Xeon(R) CPU E5-2620 v2 running at 2.10GHz.
+\item
 These CPUs have 6 cores per CPUs and 2 \glspl{hthrd} per core, for a total of 24 \glspl{hthrd}.
+The cpus each have 384 KB, 3 MB and 30 MB of L1, L2 and L3 caches respectively.
+\item
+The CPUs each have 384 KB, 3 MB and 30 MB of L1, L2 and L3 caches respectively.
+\item
 Each node is connected to the network through a Mellanox 10 Gigabit Ethernet port.
+The network route uses 1 Mellanox SX1012 10/40 Gigabit Ethernet cluster switch.
+\subsection{Memcached with threads per connection}
+Comparing against memcached using a user-level runtime only really make sense if the server actually uses this threading model.
+Indeed, evaluating a user-level runtime with 1 \at per \proc is not meaningful since it does not exercise the runtime, it simply adds some overhead to the underlying OS scheduler.
+One approach is to use a webserver that uses a thread-per-connection model, where each incoming connection is served by a single \at in a strict 1-to-1 pairing.
+This models adds flexibility to the implementation, as the serving logic can now block on user-level primitives without affecting other connections.
+Memcached is not built according to a thread-per-connection model, but there exists a port of it that is, which was built for libfibre~\cite{DBLP:journals/pomacs/KarstenB20}.
+Therefore this version can both be compared to the original version and to a port to the \CFA runtime.
+As such, this memcached experiment compares 3 different varitions of memcached:
+\begin{itemize}
+ \item \emph{vanilla}: the official release of memcached, version~1.6.9.
+ \item \emph{fibre}: a modification of vanilla which uses the thread per connection model on top of the libfibre runtime.
+\item
+Network routing is performed by a Mellanox SX1012 10/40 Gigabit Ethernet switch.
+\end{itemize}
+\subsection{Memcached threading}
+Memcached can be built to use multiple threads in addition to its @libevent@ subsystem to handle requests.
+When enabled, the threading implementation operates as follows~\cite{https://docs.oracle.com/cd/E17952_01/mysql-5.6-en/ha-memcached-using-threads.html}:
+\begin{itemize}
+\item
+Threading is handled by wrapping functions within the code to provide basic protection from updating the same global structures at the same time.
+\item
+Each thread uses its own instance of the @libevent@ to help improve performance.
+\item
+TCP/IP connections are handled with a single thread listening on the TCP/IP socket.
+Each connection is then distributed to one of the active threads on a simple round-robin basis.
+Each connection then operates solely within this thread while the connection remains open.
+\item
+For UDP connections, all the threads listen to a single UDP socket for incoming requests.
+Threads that are not currently dealing with another request ignore the incoming packet.
+One of the remaining, nonbusy, threads reads the request and sends the response.
+This implementation can lead to increased CPU load as threads wake from sleep to potentially process the request.
+\end{itemize}
+Here, Memcached is based on an event-based webserver architecture~\cite{Pai99Flash}, using \gls{kthrd}ing to run multiple (largely) independent event engines, and if needed, spinning up additional kernel threads to handle blocking I/O.
+Alternative webserver architecture are:
+\begin{itemize}
+\item
+pipeline~\cite{Welsh01}, where the event engine is subdivided into multiple stages and the stages are connected with asynchronous buffers, where the final stage has multiple threads to handle blocking I/O.
+\item
+thread-per-connection~\cite{apache,Behren03}, where each incoming connection is served by a single \at in a strict 1-to-1 pairing, using the thread stack to hold the event state and folding the event engine implicitly into the threading runtime with its nonblocking I/O mechanism.
+\end{itemize}
+Both pipelining and thread-per-connection add flexibility to the implementation, as the serving logic can now block without halting the event engine~\cite{Harji12}.
+However, \gls{kthrd}ing in Memcached is not amenable to this work, which is based on \gls{uthrding}.
+While it is feasible to layer one user thread per kernel thread, it is not meaningful as it fails to exercise the user runtime;
+it simply adds extra scheduling overhead over the kernel threading.
+Hence, there is no direct way to compare Memcached using a kernel-level runtime with a user-level runtime.
+Fortunately, there exists a recent port of Memcached to \gls{uthrding} based on the libfibre~\cite{DBLP:journals/pomacs/KarstenB20} \gls{uthrding} library.
+This port did all of the heavy-lifting, making it straightforward to replace the libfibre user-threading with the \gls{uthrding} in \CFA.
+It is now possible to compare the original kernel-threading Memcached with both user-threading runtimes in libfibre and \CFA.
+As such, this Memcached experiment compares 3 different variations of Memcached:
+\begin{itemize}
+ \item \emph{vanilla}: the official release of Memcached, version~1.6.9.
+ \item \emph{fibre}: a modification of vanilla using the thread-per-connection model on top of the libfibre runtime.
  \item \emph{cfa}: a modification of the fibre webserver that replaces the libfibre runtime with \CFA.
 \end{itemize}
 \subsection{Throughput} \label{memcd:tput}
+This experiment is done by having the clients establish 15,360 total connections, which persist for the duration of the experiment.
+The clients then send read and write queries with only 3\% writes (updates), attempting to follow a desired query rate, and the server responds to the desired rate as best as possible.
+Figure~\ref{fig:memcd:rate:qps} shows the 3 server versions at different client rates, ``Target \underline{Q}ueries \underline{P}er \underline{S}econd'', and the actual rate, ``Actual QPS'', for all three webservers.
+Like the experimental setup in Chapter~\ref{microbench}, each experiment is run 15 times, and for each client rate, the measured webserver rate is plotted.
+The solid line represents the median while the dashed and dotted lines represent the maximum and minimum respectively.
+For rates below 500K queries per seconds, all three webservers match the client rate.
+Beyond 500K, the webservers cannot match the client rate.
+During this interval, vanilla Memcached achieves the highest webserver throughput, with libfibre and \CFA slightly lower but very similar throughput.
+Overall the performance of all three webservers is very similar, especially considering that at 500K the servers have reached saturation, which is discussed more in the next section.
 \begin{figure}
         \centering
         \input{result.memcd.rate.qps.pstex_t}
         \caption[Memcached Benchmark: Throughput]{Memcached Benchmark: Throughput\smallskip\newline Desired vs Actual query rate for 15360 connections. Target QPS is the query rate that the clients are attempting to maintain and Actual QPS is the rate at which the server is able to respond.}
+        \resizebox{0.83\linewidth}{!}{\input{result.memcd.rate.qps.pstex_t}}
+        \caption[Memcached Benchmark: Throughput]{Memcached Benchmark: Throughput\smallskip\newline Desired vs Actual query rate for 15,360 connections. Target QPS is the query rate that the clients are attempting to maintain and Actual QPS is the rate at which the server is able to respond.}
         \label{fig:memcd:rate:qps}
+\end{figure}
+This experiment is done by having the clients establish 15360 total connections, which persist for the duration of the experiments.
+The clients then send queries, attempting to follow a desired query rate and the server responds to the desired rate as best they can.
+Figure~\ref{fig:memcd:rate:qps} shows the difference between desired rate, ``Target \underline{Q}ueries \underline{P}er \underline{S}econd'', and the actual rate, ``Actual QPS'', for all three webservers.
+As with the experiments in the previous chapter, 15 runs for each rate were measured and the graph shows all datapoints.
+The solid line represents the median while the dashed and dotted lines represent the maximum and minimum respectively.
+For rates below 500K queries per seconds, all three webservers can easily keep up to the desired rate, resulting in all datapoints being perfectly overlapped.
+Beyond this limit, individual runs become visible and all three servers begin to distinguish themselves, where vanilla memcached generally achieves better throughput while \CFA and libfibre fight for second place.
+Overall however the performance of all three servers is very similar, especially considering that at 500K the server has reached saturation, which is discussed more in the next section.
+\subsection{Tail Latency}
+\begin{figure}
+%\end{figure}
+\bigskip
+%\begin{figure}
         \centering
         \input{result.memcd.rate.99th.pstex_t}
         \caption[Memcached Benchmark : 99th Percentile Lantency]{Memcached Benchmark : 99th Percentile Lantency\smallskip\newline 99th Percentile of the response latency as a function of \emph{desired} query rate for 15360 connections. }
+        \resizebox{0.83\linewidth}{!}{\input{result.memcd.rate.99th.pstex_t}}
+        \caption[Memcached Benchmark : 99th Percentile Lantency]{Memcached Benchmark : 99th Percentile Lantency\smallskip\newline 99th Percentile of the response latency as a function of \emph{desired} query rate for 15,360 connections. }
         \label{fig:memcd:rate:tail}
 \end{figure}
+Another important performance metric to look at is \newterm{tail} latency.
+Since many web applications rely on a combination of different queries made in parallel, the latency of the slowest response, \ie tail latency, can dictate overall performance.
+Figure~\ref{fig:memcd:rate:tail} shows the 99th percentile latency results for the same experiment memcached experiment.
+Again, each series is made of 15 runs with the median, maximum and minimum highlighted with lines.
+As is expected, the latency starts low and increases as the server gets close to saturation, point at which the latency increses dramatically.
+\subsection{Tail Latency}
+Another popular performance metric is \newterm{tail} latency, which indicates some notion of fairness among requests across the experiment, \ie do some requests wait longer than other requests for service.
+Since many web applications rely on a combination of different queries made in parallel, the latency of the slowest response, \ie tail latency, can dictate a performance perception.
+Figure~\ref{fig:memcd:rate:tail} shows the 99th percentile latency results for the same Memcached experiment.
+Again, each experiment is run 15 times with the median, maximum and minimum plotted with different lines.
+As expected, the latency starts low and increases as the server gets close to saturation, at which point, the latency increases dramatically because the webservers cannot keep up with the connection rate so client requests are disproportionally delayed.
 Because of this dramatic increase, the Y axis is presented using log scale.
+Note that the figure shows \emph{target} query rate, the actual response rate is given in Figure~\ref{fig:memcd:rate:qps} as this is the same underlying experiment.
+For all three servers the saturation point is reached before 500K queries per second, which was when throughput started to change among the webservers.
+In this experiement, all three webservers are much more distinguishable than the throughput experiment.
+Vanilla achieves low latency mostly across the board followed by libfibre and \CFA.
+However, all three webservers achieve micro second latencies and the increases in latency mostly follow eachother.
+Note that the graph shows \emph{target} query rate, the actual response rate is given in Figure~\ref{fig:memcd:rate:qps} as this is the same underlying experiment.
+For all three servers, the saturation point is reached before 500K queries per second, which is when throughput starts to decline among the webservers.
+In this experiment, all three webservers are much more distinguishable than the throughput experiment.
+Vanilla Memcached achieves the lowest latency until 600K, after which all the webservers are struggling to respond to client requests.
+\CFA begins to decline at 600K, indicating some bottleneck after saturation.
+Overall, all three webservers achieve micro-second latencies and the increases in latency mostly follow each other.
 \subsection{Update rate}
+Since Memcached is effectively a simple database, an aspect that can significantly affect performance is wirtes.
+The information that is cached by memcached can be written to concurrently with other queries.
+I could therefore be interesting to see how this update rate affects performance.
+Since Memcached is effectively a simple database, the information that is cached can be written to concurrently by multiple queries.
+And since writes can significantly affect performance, it is interesting to see how varying the update rate affects performance.
+Figure~\ref{fig:memcd:updt} shows the results for the same experiment as the throughput and latency experiment but increasing the update percentage to 5\%, 10\% and 50\%, respectively, versus the original 3\% update percentage.
 \begin{figure}
         \subfloat[][\CFA: Throughput]{
 …
         \label{fig:memcd:updt}
 \end{figure}
+Figure~\ref{fig:memcd:updt} shows the results for the same experiement as the throughput and latency experiement but with multiple update rate.
+Each experiment was repeated with a update percentage of 3\%, 5\%, 10\% and 50\%.
+The previous experiements were run with 3\% update rates.
+In the end, this experiment mostly demonstrates that the performance of memcached is affected very little by the update rate.
+I believe this is because the underlying locking pattern is actually fairly similar.
+Indeed, since values can be much bigger than what the server can read atomically, a lock must be acquired while the value is read.
+These results suggects that memcached does not use a readers-writer lock to protect each values and instead relies on having a sufficient number of keys to limit the contention.
+In the end, this shows yet again that \CFA achieves equivalent performance.
+In the end, this experiment mostly demonstrates that the performance of Memcached is affected very little by the update rate.
+Indeed, since values read/written can be bigger than what can be read/written atomically, a lock must be acquired while the value is read.
+Hence, I believe the underlying locking pattern for reads and writes is fairly similar, if not the same.
+These results suggest Memcached does not attempt to optimize reads/writes using a readers-writer lock to protect each value and instead just relies on having a sufficient number of keys to limit contention.
+In the end, the update experiment shows that \CFA is achieving equivalent performance.
 \section{Static Web-Server}
+The memcached experiment has two aspects of the \io subsystem it does not exercise, accepting new connections and interacting with disks.
+On the other hand, static webservers, servers that offer static webpages, do stress disk \io since they serve files from disk\footnote{Dynamic webservers, which construct pages as they are sent, are not as interesting since the construction of the pages do not exercise the runtime in a meaningfully different way.}.
+The static webserver experiments will compare NGINX~\cit{nginx} with a custom webserver developped for this experiment.
+The Memcached experiment does not exercise two key aspects of the \io subsystem: accept\-ing new connections and interacting with disks.
+On the other hand, a webserver servicing static web-pages does stress both accepting connections and disk \io by accepting tens of thousands of client requests per second where these requests return static data serviced from the file-system cache or disk.\footnote{
+Webservers servicing dynamic requests, which read from multiple locations and construct a response, are not as interesting since creating the response takes more time and does not exercise the runtime in a meaningfully different way.}
+The static webserver experiment compares NGINX~\cite{nginx} with a custom \CFA-based webserver developed for this experiment.
 \subsection{\CFA webserver}
+Unlike the memcached experiment, the webserver experiment relies on a custom designed webserver.
+It is a simple thread-per-connection webserver where a fixed number of \ats are created upfront.
+Each of the \at calls @accept@, through @io_uring@, on the listening port and handle the incomming connection once accepted.
+Most of the implementation is fairly straight forward however the inclusion of file \io introduces a new challenge that had to be hacked around.
+Normally, webservers use @sendfile@\cite{MAN:sendfile} to send files over the socket.
+@io_uring@ does not support @sendfile@, it supports @splice@\cite{MAN:splice} instead, which is strictly more powerful.
+However, because of how linux implements file \io, see Subsection~\ref{ononblock}, @io_uring@'s implementation must delegate calls to splice to worker threads inside the kernel.
+As of Linux 5.13, @io_uring@ caps the numer of these worker threads to @RLIMIT_NPROC@ and therefore, when tens of thousands of splice requests are made, it can create tens of thousands of \glspl{kthrd}.
+Such a high number of \glspl{kthrd} is more than Linux can handle in this scenario so performance suffers significantly.
+For this reason, the \CFA webserver calls @sendfile@ directly.
+This approach works up to a certain point, but once the server approaches saturation, it leads to a new problem.
+When the saturation point of the server is attained, latency will increase and inevitably some client connections will timeout.
+As these clients close there connections, the server must close these sockets without delay so the OS can reclaim the resources used by these connections.
+Indeed, until they are closed on the server end, the connection will linger in the CLOSE-WAIT tcp state~\cite{rfc:tcp} and the tcp buffers will be preserved.
+However, this poses a problem using blocking @sendfile@ calls.
+The calls can block if they do not have suffcient memory, which can be caused by having too many connections in the CLOSE-WAIT state.
+Since blocking in calls to @sendfile@ blocks the \proc rather than the \at, this prevents other connections from closing their sockets.
+This leads to a vicious cycle where timeouts lead to @sendfile@ calls running out of resources, which lead to more timeouts.
+Normally, this is address by marking the sockets as non-blocking and using @epoll@ to wait for sockets to have sufficient resources.
+However, since @io_uring@ respects non-blocking semantics marking all sockets as non-blocking effectively circumvents the @io_uring@ subsystem entirely.
+The \CFA webserver is a straightforward thread-per-connection webserver, where a fixed number of \ats are created upfront (tuning parameter).
+Each \at calls @accept@, through @io_uring@, on the listening port and handles the incoming connection once accepted.
+Most of the implementation is fairly straightforward;
+however, the inclusion of file \io found an @io_uring@ problem that required an unfortunate workaround.
+Normally, webservers use @sendfile@~\cite{MAN:sendfile} to send files over a socket because it performs a direct move in the kernel from the file-system cache to the NIC, eliminating reading/writing the file into the webserver.
+While @io_uring@ does not support @sendfile@, it does supports @splice@~\cite{MAN:splice}, which is strictly more powerful.
+However, because of how Linux implements file \io, see Subsection~\ref{ononblock}, @io_uring@ must delegate splice calls to worker threads inside the kernel.
+As of Linux 5.13, @io_uring@ had no mechanism to restrict the number of worker threads, and therefore, when tens of thousands of splice requests are made, it correspondingly creates tens of thousands of internal \glspl{kthrd}.
+Such a high number of \glspl{kthrd} slows Linux significantly.
+Rather than abandon the experiment, the \CFA webserver was switched to nonblocking @sendfile@.
+However, when the nonblocking @sendfile@ returns @EAGAIN@, the \CFA server cannot block the \at because its I/O subsystem uses @io_uring@.
+Therefore, the \at must spin performing the @sendfile@ and yield if the call returns @EAGAIN@.
+This workaround works up to the saturation point, when other problems occur.
+At saturation, latency increases so some client connections timeout.
+As these clients close their connection, the server must close its corresponding side without delay so the OS can reclaim the resources used by these connections.
+Indeed, until the server connection is closed, the connection lingers in the CLOSE-WAIT TCP state~\cite{rfc:tcp} and the TCP buffers are preserved.
+However, this poses a problem using nonblocking @sendfile@ calls:
+the call can still block if there is insufficient memory, which can be caused by having too many connections in the CLOSE-WAIT state.\footnote{
+\lstinline{sendfile} can always block even in nonblocking mode if the file to be sent is not in the file-system cache, because Linux does not provide nonblocking disk I/O.}
+When @sendfile@ blocks, the \proc rather than the \at blocks, preventing other connections from closing their sockets.
+This effect results in a negative feedback where more timeouts lead to more @sendfile@ calls running out of resources.
+Normally, this is address by using @select@/@epoll@ to wait for sockets to have sufficient resources.
+However, since @io_uring@ respects nonblocking semantics, marking all sockets as non-blocking effectively circumvents the @io_uring@ subsystem entirely.
 For this reason, the \CFA webserver sets and resets the @O_NONBLOCK@ flag before and after any calls to @sendfile@.
 Normally @epoll@ would also be used when these calls to @sendfile@ return @EAGAIN@, but since this would not help in the evaluation of the \CFA runtime, the \CFA webserver simply yields and retries in these cases.
 It is important to state that in Linux 5.15 @io_uring@ introduces the ability for users to limit the number of worker threads that are created, through the @IORING_REGISTER_IOWQ_MAX_WORKERS@ option.
+Interestingly, Linux 5.15 @io_uring@ introduces the ability to limit the number of worker threads that are created, through the @IORING_REGISTER_IOWQ_MAX_WORKERS@ option.
 However, as of writing this document Ubuntu does not have a stable release of Linux 5.15.
 There exists versions of the kernel that are currently under testing, but these caused unrelated but nevertheless prohibitive issues in this experiment.
 …
 \subsection{Benchmark Environment}
+Unlike the memcached experiment, the webserver run on a more heterogenous environment.
+Unlike the Memcached experiment, the webserver experiment is run on a heterogeneous environment.
+\begin{itemize}
+\item
 The server runs Ubuntu 20.04.4 LTS on top of Linux Kernel 5.13.0-52.
+It has an AMD Opteron(tm) Processor 6380 running at 2.50GHz.
+These CPUs has only 8 \glspl{hthrd} enabled by grub, which is sufficient to achieve line rate.
+This cpus each have 64 KB, 256 KiB and 8 MB of L1, L2 and L3 caches respectively.
+The kernel is setup to limit the memory at 25Gb.
+The client machines each have two 2.8 GHz Xeon CPUs, and four one-gigabit Ethernet cards.
+Each client machine runs two copies of the workload generator.
+They run a 2.6.11-1 SMP Linux kernel, which permits each client load-generator to run on a separate CPU.
+Since the clients outnumber the server 8-to-1, this is plenty sufficient to generate enough load for the clients not to become the bottleneck.
+\item
+It has an AMD Opteron(tm) Processor 6380 running at 2.5GHz.
+\item
+Each CPU has 64 KB, 256 KiB and 8 MB of L1, L2 and L3 caches respectively.
+\item
+The computer is booted with only 8 CPUs enabled, which is sufficient to achieve line rate.
+\item
+The computer is booted with only 25GB of memory to restrict the file-system cache.
+\end{itemize}
+There are 8 client machines.
+\begin{itemize}
+\item
+A client runs a 2.6.11-1 SMP Linux kernel, which permits each client load-generator to run on a separate CPU.
+\item
+It has two 2.8 GHz Xeon CPUs, and four one-gigabit Ethernet cards.
+\item
 \todo{switch}
+\item
+A client machine runs two copies of the workload generator.
+\end{itemize}
+The clients and network are sufficiently provisioned to drive the server to saturation and beyond.
+Hence, any server effects are attributable solely to the runtime system and webserver.
+Finally, without restricting the server hardware resources, it is impossible to determine if a runtime system or the webserver using it has any specific design restrictions, \eg using space to reduce time.
+Trying to determine these restriction with large numbers of processors or memory simply means running equally large experiments, which takes longer and are harder to set up.
 \subsection{Throughput}
+To measure the throughput of both webservers, each server is loaded with over 30,000 files making over 4.5 Gigabytes in total.
+Each client runs httperf~\cit{httperf} which establishes a connection, does an http request for one or more files, closes the connection and repeats the process.
+The connections and requests are made according to a Zipfian distribution~\cite{zipf}.
+To measure webserver throughput, the server computer is loaded with 21,600 files, sharded across 650 directories, occupying about 2.2GB of disk, distributed over the server's RAID-5 4-drives to achieve high throughput for disk I/O.
+The clients run httperf~\cite{httperf} to request a set of static files.
+The httperf load-generator is used with session files to simulate a large number of users and to implement a partially open-loop system.
+This permits httperf to produce overload conditions, generate multiple requests from persistent HTTP/1.1 connections, and include both active and inactive off periods to model browser processing times and user think times~\cite{Barford98}.
+The experiments are run with 16 clients, each running a copy of httperf (one copy per CPU), requiring a set of 16 log files with requests conforming to a Zipf distribution.
+This distribution is representative of users accessing static data through a web-browser.
+Each request reads a file name from its trace, establishes a connection, performs an HTTP get-request for the file name, receive the file data, close the connection, and repeat the process.
+Some trace elements have multiple file names that are read across a persistent connection.
+A client times-out if the server does not complete a request within 10 seconds.
+An experiment consists of running a server with request rates ranging from 10,000 to 70,000 requests per second;
+each rate takes about 5 minutes to complete.
+There is 20 seconds idle time between rates and between experiments to allow connections in the TIME-WAIT state to clear.
+Server throughput is measured both at peak and after saturation (\ie after peak).
+Peak indicates the level of client requests the server can handle and after peak indicates if a server degrades gracefully.
 Throughput is measured by aggregating the results from httperf of all the clients.
+Two workload scenarios are created by reconfiguring the server with different amounts of memory: 4 GB and 2 GB.
+The two workloads correspond to in-memory (4 GB) and disk-I/O (2 GB).
+Due to the Zipf distribution, only a small amount of memory is needed to service a significant percentage of requests.
+Table~\ref{t:CumulativeMemory} shows the cumulative memory required to satisfy the specified percentage of requests; e.g., 95\% of the requests come from 126.5 MB of the file set and 95\% of the requests are for files less than or equal to 51,200 bytes.
+Interestingly, with 2 GB of memory, significant disk-I/O occurs.
+\begin{table}
+\caption{Cumulative memory for requests by file size}
+\label{t:CumulativeMemory}
+\begin{tabular}{r|rrrrrrrr}
+\% Requests   & 10 & 30 & 50 & 70 & 80 & 90 & \textbf{95} & 100 \\
+Memory (MB)   & 0.5 & 1.5 & 8.4 & 12.2 & 20.1 & 94.3 & \textbf{126.5} & 2,291.6 \\
+File Size (B) & 409 & 716 & 4,096 & 5,120 & 7,168 & 40,960 & \textbf{51,200} & 921,600
+\end{tabular}
+\end{table}
+Figure~\ref{fig:swbsrv} shows the results comparing \CFA to NGINX in terms of throughput.
+These results are fairly straightforward.
+Both servers achieve the same throughput until around 57,500 requests per seconds.
+Since the clients are asking for the same files, the fact that the throughput matches exactly is expected as long as both servers are able to serve the desired rate.
+Once the saturation point is reached, both servers are still very close.
+NGINX achieves slightly better throughput.
+However, Figure~\ref{fig:swbsrv:err} shows the rate of errors, a gross approximation of tail latency, where \CFA achieves notably fewer errors once the machine reaches saturation.
+This suggest that \CFA is slightly more fair and NGINX may slightly sacrifice some fairness for improved throughput.
+It demonstrate that the \CFA webserver described above is able to match the performance of NGINX up-to and beyond the saturation point of the machine.
 \begin{figure}
         \subfloat[][Throughput]{
                 \input{result.swbsrv.25gb.pstex_t}
+                \resizebox{0.85\linewidth}{!}{\input{result.swbsrv.25gb.pstex_t}}
                 \label{fig:swbsrv:ops}
+        }
         \subfloat[][Rate of Errors]{
                 \input{result.swbsrv.25gb.err.pstex_t}
+                \resizebox{0.85\linewidth}{!}{\input{result.swbsrv.25gb.err.pstex_t}}
                 \label{fig:swbsrv:err}
+        }
 …
         \label{fig:swbsrv}
 \end{figure}
-Figure~\ref{fig:swbsrv} shows the results comparing \CFA to NGINX in terms of throughput.
-These results are fairly straight forward.
-Both servers achieve the same throughput until around 57,500 requests per seconds.
-Since the clients are asking for the same files, the fact that the throughput matches exactly is expected as long as both servers are able to serve the desired rate.
-Once the saturation point is reached, both servers are still very close.
-NGINX achieves slightly better throughtput.
-However, Figure~\ref{fig:swbsrv:err} shows the rate of errors, a gross approximation of tail latency, where \CFA achives notably fewet errors once the machine reaches saturation.
-This suggest that \CFA is slightly more fair and NGINX may sloghtly sacrifice some fairness for improved throughtput.
-It demonstrate that the \CFA webserver described above is able to match the performance of NGINX up-to and beyond the saturation point of the machine.
 \subsection{Disk Operations}
 The throughput was made using a server with 25gb of memory, this was sufficient to hold the entire fileset in addition to all the code and data needed to run the webserver and the reste of the machine.
+The throughput was made using a server with 25gb of memory, this was sufficient to hold the entire fileset in addition to all the code and data needed to run the webserver and the rest of the machine.
 Previous work like \cit{Cite Ashif's stuff} demonstrate that an interesting follow-up experiment is to rerun the same throughput experiment but allowing significantly less memory on the machine.
 If the machine is constrained enough, it will force the OS to evict files from the file cache and cause calls to @sendfile@ to have to read from disk.
 However, what these low memory experiments demonstrate is how the memory footprint of the webserver affects the performance.
 However, since what I am to evaluate in this thesis is the runtime of \CFA, I diceded to forgo experiments on low memory server.
+However, since what I am to evaluate in this thesis is the runtime of \CFA, I decided to forgo experiments on low memory server.
 The implementation of the webserver itself is simply too impactful to be an interesting evaluation of the underlying runtime.

Note: See TracChangeset for help on using the changeset viewer.

Context Navigation

Changeset fcfbc52

Legend:

doc/theses/thierry_delisle_PhD/thesis/text/eval_macro.tex

Download in other formats: