Searcharxiv⌕ Search

arXiv subjects

Stephen Thomas

Publications and source records attributed to Stephen Thomas.

21 records · Page 2Linked to original sources

A Survey of Numerical Methods Utilizing Mixed Precision Arithmetic

Within the past years, hardware vendors have started designing low precision special function units in response to the demand of the Machine Learning community and their demand for high compute power in low precision formats. Also the server-line products are increasingly featuring low-precision special function units, such as the NVIDIA tensor cores in ORNL's Summit supercomputer providing more than an order of magnitude higher performance than what is available in IEEE double precision. At the same time, the gap between the compute power on the one hand and the memory bandwidth on the other hand keeps increasing, making data access and communication prohibitively expensive compared to arithmetic operations. To start the multiprecision focus effort, we survey the numerical linear algebra community and summarize all existing multiprecision knowledge, expertise, and software capabilities in this landscape analysis report. We also include current efforts and preliminary results that may not yet be considered "mature technology," but have the potential to grow into production quality within the multiprecision focus effort. As we expect the reader to be familiar with the basics of numerical linear algebra, we refrain from providing a detailed background on the algorithms themselves but focus on how mixed- and multiprecision technology can help improving the performance of these methods and present highlights of application significantly outperforming the traditional fixed precision methods.

cs.MS↗

Low synchronization GMRES algorithms

Communication-avoiding and pipelined variants of Krylov solvers are critical for the scalability of linear system solvers on future exascale architectures. We present low synchronization variants of iterated classical (CGS) and modified Gram-Schmidt (MGS) algorithms that require one and two global reduction communication steps. Derivations of low synchronization iterated CGS algorithms are based on previous work by Ruhe. Our main contribution is to introduce a backward normalization lag into the compact $WY$ form of MGS resulting in a ${\cal O}(\eps)κ(A)$ stable GMRES algorithm that requires only one global synchronization per iteration. The reduction operations are overlapped with computations and pipelined to optimize performance. Further improvements in performance are achieved by accelerating GMRES BLAS-2 operations on GPUs.

math.NA↗

The LCFIVertex package: vertexing, flavour tagging and vertex charge reconstruction with an ILC vertex detector

The precision measurements envisaged at the International Linear Collider (ILC) depend on excellent instrumentation and reconstruction software. The correct identification of heavy flavour jets, placing unprecedented requirements on the quality of the vertex detector, will be central for the ILC programme. This paper describes the LCFIVertex software, which provides tools for vertex finding and for identification of the flavour and charge of the leading hadron in heavy flavour jets. These tools are essential for the ongoing optimisation of the vertex detector design for linear colliders such as the ILC. The paper describes the algorithms implemented in the LCFIVertex package, as well as the scope of the code and its performance for a typical vertex detector design.

physics.ins-det↗