1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466
|
\include{header}
% Title Page
\title{
{\Huge\bf \reporttitle{}}\\[6mm]
{\LARGE\bf \reportsubtitle}\\[12mm]
{\Large\bf \reportsubsubtitle}}
\author{Roman Iakymchuk and Fran\c{c}ois Trahay}
\begin{document}
\hypersetup{pageanchor=false}
\maketitle
\hypersetup{pageanchor=true}
% \setcounter{page}{2}
\tableofcontents
\chapter{License of \litl}
Copyright (c) 2013, Télécom SudParis\\
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
\begin{itemize}
\item Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
\item Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
\end{itemize}
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
\chapter{Overview of \litl}
\litl{}~\cite{litl} is a lightweight binary trace library that aims at
providing performance analysis tools with a scalable event recording mechanism
that utilizes minimum resources of the CPU and memory. In order to efficiently
analyze modern HPC applications that combine \openmp{} (or \pthread) threads
and \mpi{} processes, we design and implement various mechanisms to ensure the
scalability of \litl{} for a large number of both threads and processes.
\litl{} is designed in order to resolve the following performance tracing
issues:
\begin{itemize}
\item Scalability and the number of threads;
\item Scalability and the number of recorded traces;
\item Optimization in the storage capacity usage.
\end{itemize}
As a result, \litl{} provides similar functionality to standard event recording
libraries and records events only from user-space. \litl{} minimizes the usage
of the CPU time and memory space in order to avoid disturbing the application
that is being analyzed. Also, \litl{} is fully thread-safe that allows to record
events from multi-threaded applications. Finally, \litl{} is a generic library
that can be used in conjunction with many performance analysis tools and
frameworks.
\chapter{Installation}
\section{Requirements}
In order to use \litl{}, the following software is required:
\begin{enumerate}
\item autoconf of version 2.63;
\end{enumerate}
\section{Getting \litl}
Current development version of \litl{} is available via Git\\
\hspace*{0.9cm}\texttt{git clone git+ssh://fusionforge.int-evry.fr//var/lib/}\\
\hspace*{0.9cm}\texttt{gforge/chroot/scmrepos/git/litl/litl.git}\\
After getting the latest development version from Git, the following command
should be run\\
\hspace*{0.9cm}\texttt{./bootstrap}\\
And, only afterwards the tool can be built.
\section{Building \eztrace{}}
At first, to configure \litl{} the following configure script should be
invoked\\
\hspace*{0.9cm}\texttt{./configure -\,-prefix=<LITL\_INSTALL\_DIR>}\\
The configuration script contains many different options that can be set.
However, during the first try we recommend to use the default settings.
Once \litl{} is configured, the next two commands should be executed to complete
the building\\
\hspace*{0.9cm}\texttt{make}\\
\hspace*{0.9cm}\texttt{make install}
In order to check whether \litl{} was installed correctly, a set of tests can be
run as\\
\hspace*{0.9cm}\texttt{make check}
\chapter{How to Use \litl{}?}
\section{Reading Events}
After the application was traced and events were recorded into binary trace
files, those traces can be analyzed using \texttt{litl\_read} as\\
\hspace*{0.9cm}\texttt{litl\_read -f trace.file}\\
This utility shows the recorded events in the following format:
\begin{itemize}
\item Time since last probe record on the same CPU;
\item ID of the current thread on this CPU;
\item Event type;
\item Code of the probe;
\item Number of parameters of the probe;
\item List of parameters of the probe, if any.
\end{itemize}
\section{Merging Traces}
Once the traces were recorded, they can be merged into an archive of traces for
further processing by the following command\\
\hspace*{0.9cm}\texttt{litl\_read -o archive.trace trace.0 trace.1 ... trace.n}
\section{Splitting Traces}
In case of a need for a detailed analysis of a particular trace files, an archive
of traces can be split back into separate traces by\\
\hspace*{0.9cm}\texttt{litl\_read -f archive.trace -d output.dir}
\section{Environment Variables}
For a more flexible and comfortable usage of \litl{}, we provide the following
environment variables:
\begin{itemize}
\item \texttt{LITL\_BUFFER\_SIZE} provides users with the alternative
possibility to set a buffer size. If the variable is not specified, then
the provided value inside the application is used;
\item \texttt{LITL\_BUFFER\_FLUSH} specifies the behavior of \litl{} when the
event buffer is full. If it is set to ``0'', \litl{} stop recording
events. The trace is, thus, truncated and there is no impact on the
application performance. If it is set to ``1'' the buffer is written to
disk and additional events can be recorded. This permits to record traces
that are larger than the buffer size. Please note that the Flush policy
may have a significant impact on the application performance since it
requires to write a large amount of data to disk during the execution of
the application. The default value is \textbf{0}.
\item \texttt{LITL\_TID\_RECORDING} provides users with an alternative
possibility to enable or disable tid recording. If it is set to ``1'',
the tid recording is enabled. Otherwise, when it is set to ``0'', the tid
recording is disable; The default value is \textbf{1}.
\item \texttt{LITL\_THREAD\_SAFETY} specifies the behavior of \litl{} while
tracing multi-threaded applications. If it is set to ``1'', the thread
safety is enabled. Otherwise, when it is set to ``0'', the event
recording is not thread safe; The default value is \textbf{1}.
\item \texttt{LITL\_TIMING\_METHOD} specifies the timing method that will be
used during the recording phase. The \litl{} timing methods can be
divided into two groups: those that measure time in clock ticks and
those that rely on the \texttt{clock\_gettime()} function. The first
group has only one method:
\begin{itemize}
\item \texttt{ticks} that uses the CPU specific register, e.g. rdtsc
on X86 and X86\_64 architectures.
\end{itemize}
The second group comprises of the other five different methods:
\begin{itemize}
\item \texttt{monotonic} that corresponds to \texttt{CLOCK\_MONOTONIC};
\item \texttt{monotonic\_raw}\dash{}\texttt{CLOCK\_MONOTONIC\_RAW};
\item \texttt{realtime}\dash{}\texttt{CLOCK\_REALTIME};
\item \texttt{thread\_cputime}\dash{}\texttt{CLOCK\_THREAD\_CPUTIME\_ID};
\item \texttt{process\_cputime}\dash{}\texttt{CLOCK\_PROCESS\_CPUTIME\_ID}.
\end{itemize}
User can also define its own timing method and set the environment
variable accordingly.
\end{itemize}
\chapter{\litl{} in Details}
\section{Event Types and The Storage Usage}
Each event in the \litl{} library consists of two parts: the event core (the
event code, the time when the event occurred, the thread identifier, and the
number of parameters) and event parameters. The number of event parameters
recorded by \litl{} varies from zero to ten.
The parameters passed to each event have different data type. In order to handle
the variety of possible cases, event's parameters in \litl{} can be represented
by the largest data type, which is \texttt{uint64\_t} on x86\_64 architectures.
Hence, any parameter -- no matter whether it is a \texttt{char}, an
\texttt{int} or a \texttt{long int} -- can be recorded without being truncated.
However, the reserved slot for each parameter is often bigger than its actual
size. Thus, this leads to the non-optimal usage of resources.
Our goal is to keep trace files as small as possible without
losing any of the recorded data. Therefore, we propose to use the compacted
event storage that aims at utilizing every byte from the allocated space.
In our approach, we introduce three different types of events: regular, raw, and
packed. The regular event is without any major optimization being involved.
The raw event stores parameters in the string format. Its purpose is to gather
either the regular parameters in a string format or the information about the
abnormal behavior of applications like thrown exceptions.
The packed event represents the optimized versions of storing events, where
each parameter can be saved as a group of bytes. Accordingly, by using the
event type packed for recording and storing events, we theoretically are
capable to save up to 65\,\% of the disk space compare to the regular \litl{}.
\Cref{fig:event_storage_fxt} shows, on an example of three regular events with
different number of parameters, the occupied space of events within the trace
file recorded by \eztrace\ with \litl{}. We symbolically partitioned the trace
file into bytes and also chunks of bytes, which store event's components. The
space occupied by each event is highlighted with parentheses.
\begin{landscape}
\input{@top_srcdir@/doc/tikz/event.storage.all.line.packed}
\input{@top_srcdir@/doc/tikz/event.storage.trace.file}
\end{landscape}
\Cref{fig:event_storage_litl} shows the storage of the recorded packed events in
the trace file while using \eztrace\ with \litl{}. We consider one particular
scenario when each event's parameter can be represented by \texttt{uint8\_t};
this requires only one byte for the storage. To store larger event's parameters
we use arrays of \texttt{uint8\_t}. This scenario corresponds to the optimal
performance in terms of the memory and disk space usage. Under this approach,
not only the size of the core event's components is shrunk, but also the size
of event's parameters is reduced significantly. The gained performance, e.i.
the reduced space, can be characterized by the gray area that corresponds to the
difference in storage between the regular and packed events. The size of three
packed events is smaller than the size of one regular event with five
parameters. This figure confirms our assumption regarding the possibility of
reducing the size of both the recorded events and trace files.
\section{Scalability vs. the Number of Threads}
The advent of multi-core processor have led to the increase in the number of
processing units per machine. It becomes usual to equip a typical high
performance computing platform with 8, 16, or even more cores per node.
In order to exploit efficiently such facilities, developers can use hybrid
programming models that mix \openmp{} (or \pthread) threads and \mpi{}
processes within one application. Hence, the number of threads per node, which
executes the same application, can be quite large\dash{}8, 16, or even more
threads. The number of threads per node is the scalability issue for the
conventional binary tracing libraries such as \fxt{}~\cite{Danjean05FxT},
because in its implementation all threads within one process record events into
a single buffer, see~\Cref{fig:event_recording_fxt}.
This recording mechanism causes a {\em contention} problem\dash{}when
multiple threads record events simultaneously, the pointer to the next
available slot in the buffer is changed concurrently. The modifications of the
pointer can be done atomically in order to preserve the data consistency.
However, the atomic operation does not scale quite well when it is performed by
a large number of threads at the same time. Thus, analyzing \openmp{}
applications that run lots of threads using such tracing libraries may result
in the high overhead.
\input{@top_srcdir@/doc/tikz/event.recording.all}
\subsection{Recording Events}
While designing \litl{}, we aim at resolving the above-mentioned limitation of
\fxt{}. Thus, we propose to record events into separate buffers, meaning to
have one buffer per thread instead of one buffer per process. This approach is
illustrated on~\Cref{fig:event_recording_litl}.
To keep multiple buffers in order within the trace file, we add a header into
the trace file with the information regarding the number of threads and pairs
\emph{<tid, offset>}; \emph{tid} stands for the thread identifier;
\emph{offset} corresponds to the position of the first chunk of events for a
given thread within the trace starting from its beginning. The last event
of each chunk contains either an \emph{offset} to the next chunk of events
or a symbol specifying the end of recording for a given thread. While flushing
the current buffer to the trace file, the following two actions are performed:
\begin{enumerate}
\item Setting the offset of the current chunk to specify the end of the
recording;
\item Update the offset from the previous chunk to point to the current one.
\end{enumerate}
\Cref{fig:event_storage_trace} demonstrates the storage mechanism on an example
of three threads, including the positioning of chunks of events as well as
the way of linking those chunks into one chain of the corresponding thread
using offsets.
During the application execution, it may occur that some threads start
recording events later than others. This scenario requires appropriate
modifications and adjustments to the above approach. According to the previous
approach, the header is the first block of data that is added to the trace file;
it is written before flushing the first chunk of events. Thus, the header
contains the information only regarding the started threads. In order to add
pairs \emph{<tid, offset>} of the late threads, we reserve a space for $64$
pairs (chunk of pairs) between chunks of events within the trace file. So, when
one among those late threads wants to flush its buffer to the trace file, we add
its pair \emph{<tid, offset>} directly to the next free spot in the chunk of
pairs. The chunks of pairs are binded with offset in the same way as chunks of
events. Therefore, \eztrace{} does not have limitations on the number of threads
per process and also processes.
\subsection{Post-Mortem Analysis}
We develop the functionality for analyzing the generated traces by capturing the
procedure of the event recording mechanism.
At first, \litl{} reads the trace header with the information
regarding the buffer size, threads (the number of threads, tids, and
offsets), and also pairs \emph{<tid, offset>} that correspond to the late
threads. Using this preliminary information, \litl{} allocates memory buffers for
reading; the number of buffers equals the number of threads used during the
recording phase, meaning one buffer per thread. Then, \litl{} loads chunks of events
from the trace file into these buffers using pairs \emph{<tid, offset>}.
After processing the first chunks of events, \litl{} loads the buffers with the next
ones using the information concerning their positions in the trace, which is
given by the offsets. This procedure is recursive and stops when the symbol
specifying the end of recording is reached.
\section{Scalability vs. the Number of Traces}
Usually binary tracing libraries generate one trace file per process. This means
that for parallel applications with hundreds of \mpi{} processes the equal
amount of trace files is created. This is one side of the problem. The other
side appears while analyzing the applications execution due to the limitation
on the number of trace files that can be opened and processed at the same time.
Therefore, often those tracing libraries do not perform well and even crashes
when the number of traces exceeds the Linux OS limit on the number of
simultaneously opened files.
In order to overcome the opened files limitation imposed by the Linux OS, one
may increase the limit to the maximum possible value. However, this would
temporarily solve the problem. Instead, we propose to create archives of traces
during the post-mortem phase. More precisely, we suggest to merge multiple
traces into a trace archive using the \texttt{litl\_merge} utility from \litl.
\Cref{fig:storage_trace_merge} illustrates the structure of the new combined
trace created by \texttt{litl\_merge}. The archives of traces preserve all
information concerning each trace: headers, pairs \emph{<tid, offset>},
and positioning of events chunks. They also contain new global headers that
store the information regarding the amount of trace files in the archive and
triples \emph{<fid, size, offset>}; \emph{fid} stands for a file identifier;
\emph{size} is a size of a particular trace file; \emph{offset} holds the
position of a trace file within the archive of traces. Therefore, archives of
traces not only solve the performance analysis problem, but also make the
further analysis of the applications performance more convenient.
One more useful feature provided by \litl{}, which is the opposite of
\texttt{litl\_merge}, is a possibility to extract trace files from archives
with the \texttt{litl\_split} utility. This utility can be applied when there is
a need to analyze a particular trace or a set of traces among the merged ones.
\begin{landscape}
\input{@top_srcdir@/doc/tikz/event.storage.trace.file.merge}
\end{landscape}
\chapter{\litl{} in \fxt{} Applications}
In this chapter, we present an approach of integrating \litl\ (as a possible
replacement of \fxt{} and enable its usage in parallel with \fxt) into
applications that already reply on \fxt{}. To simplify the process of
integrating \litl\ into such applications, we map the functionality of
\litl\ into the corresponding functionality from \fxt\ in \texttt{fxt.h} and
\texttt{fut.h} headers; those files are part of \litl. As a result, developers
of those applications can easier switch between two binary trace libraries and
use \litl\ in conjunction with these two header files. Therefore, only minor
changes are applied to the applications code.
Even though \litl\ and \fxt\ target the same issue of gathering the
information of the application execution, they have differences in the
organization of the event recording as well as the event reading processes. In
order to deal with those differences, we suggest to modify \fxt-related
applications by following our suggestions.
\section{Recording Events}
The main difference between two trace libraries is in the organization of the
initialization phase of the event recording process. So, in \fxt\ it is
implemented as
\lstset{language=C, caption={}, label={lstl:fxt}}
\begin{lstlisting}
fut_set_filename(filename);
if (allow_flush && ...) {
enable_fut_flush();
}
fut_enable_tid_logging();
// IMPORTANT! fut_setup is AFTER all auxiliary functions
if (fut_setup(buffer_size, FUT_KEYMASKALL, thread_id) < 0) {
perror("fut_setup");
}
\end{lstlisting}
While in \litl\ the procedure is the following
\lstset{language=C, caption={}, label={lstl:litl}}
\begin{lstlisting}
litl_trace = litl_write_init_trace(buffer_size);
// the recording should be paused, because some further functions,
// e.g. *_set_filename() can be intercepted
litl_write_pause_recording(litl_trace);
if (allow_flush && ...) {
litl_write_buffer_flush_on(litl_trace);
}
litl_write_tid_recording_on(litl_trace);
litl_write_set_filename(litl_trace, filename);
// Do not forget to resume recording
litl_write_resume_recording(litl_trace);
\end{lstlisting}
The mapping between the \litl\ and \fxt\ functions, which is implemented in
\texttt{fut.h} and \texttt{fxt.h}, is organized as follow
\begin{center}
\begin{tabular}{lll}
\hline\\
\texttt{fut\_setup()} & $\rightarrow$ & \texttt{litl\_write\_init\_trace()}\\
& & \texttt{litl\_write\_pause\_recording()}\\
\texttt{enable\_fut\_flush()} & $\rightarrow$ & \texttt{litl\_write\_buffer\_flush\_on()}\\
\texttt{fut\_enable\_tid\_logging()} & $\rightarrow$ & \texttt{litl\_write\_tid\_recording\_on()} \\
\texttt{fut\_set\_filename()} & $\rightarrow$ & \texttt{litl\_write\_set\_filename()}\\
& & \texttt{litl\_write\_resume\_recording()}\\
\hline\\
\end{tabular}
\end{center}
As a result, \litl\ can be used within the \fxt-related applications by
simply replacing the \fxt\ code as follow
\lstset{language=C, caption={}, label={lstl:litl_new}}
\begin{lstlisting}
// IMPORTANT! fut_setup is BEFORE all auxiliary functions
if (fut_setup(buffer_size, FUT_KEYMASKALL, thread_id) < 0) {
perror("fut_setup");
}
fut_set_filename(filename);
if (allow_flush && ...) {
enable_fut_flush();
}
fut_enable_tid_logging();
\end{lstlisting}
Finally, the mapping between the \litl\ and \fxt\ event recording functions is
organized as
\begin{center}
\begin{tabular}{lll}
\hline\\
\texttt{FUT\_DO\_PROBEx()} & $\rightarrow$ & \texttt{litl\_write\_probe\_pack\_x()}\\
\texttt{FUT\_DO\_PROBE()} & $\rightarrow$ & \texttt{litl\_write\_probe\_pack\_0()}\\
\texttt{FUT\_DO\_PROBESTR()} & $\rightarrow$ & \texttt{litl\_write\_probe\_raw()}\\
\hline\\
\end{tabular}
\end{center}
For the successful and easy porting of \litl\ into your \fxt-related
applications the above-mentioned suggestions needs to be incorporated.
\chapter{Troubleshooting}
If you encounter a bug or want some explanation about \litl{}, please contact
and ask our development team on the development mailing list
\begin{itemize}
\item \url{litl-devel@fusionforge.int-evry.fr}.
\end{itemize}
\bibliographystyle{plain}
\cleardoublepage
\phantomsection
\addcontentsline{toc}{chapter}{Bibliography}
\small
\bibliography{@top_srcdir@/doc/references}
\normalsize
\end{document}
|