Zobrazeno 1 - 10
of 274
pro vyhledávání: '"Bientinesi Paolo"'
We aim to identify the differences in Input/Output(I/O) behavior between multiple user programs through the inspection of system calls (i.e., requests made to the operating system). A typical program issues a large number of I/O requests to the opera
Externí odkaz:
http://arxiv.org/abs/2408.07378
Automatic drum transcription is a critical tool in Music Information Retrieval for extracting and analyzing the rhythm of a music track, but it is limited by the size of the datasets available for training. A popular method used to increase the amoun
Externí odkaz:
http://arxiv.org/abs/2407.19823
We consider the problem of ranking a set of objects based on their performance when the measurement of said performance is subject to noise. In this scenario, the performance is measured repeatedly, resulting in a range of measurements for each objec
Externí odkaz:
http://arxiv.org/abs/2405.18259
Mixed-precision computing has the potential to significantly reduce the cost of exascale computations, but determining when and how to implement it in programs can be challenging. In this article, we consider Nekbone, a mini-application for the CFD s
Externí odkaz:
http://arxiv.org/abs/2405.11065
For a given product of $n$ matrices, the matrix chain multiplication problem asks for a parenthesisation that minimises the number of arithmetic operations. In 1973, Godbole presented a now classical dynamic programming formulation with cubic time co
Externí odkaz:
http://arxiv.org/abs/2303.17352
Autor:
Sankaran, Aravind, Bientinesi, Paolo
Publikováno v:
2022 IEEE 34th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD)
Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence identifies a compu
Externí odkaz:
http://arxiv.org/abs/2209.03258
Autor:
Chelini, Lorenzo, Barthels, Henrik, Bientinesi, Paolo, Copik, Marcin, Grosser, Tobias, Spampinato, Daniele G.
Modern research in code generators for dense linear algebra computations has shown the ability to produce optimized code with a performance which compares and often exceeds the one of state-of-the-art implementations by domain experts. However, the u
Externí odkaz:
http://arxiv.org/abs/2208.10391
Publikováno v:
Francisco L\'opez, Lars Karlsson, and Paolo Bientinesi. 2022. FLOPs as a Discriminant for Dense Linear Algebra Algorithms. In 51st International Conference on Parallel Processing (ICPP'22), August 29-September 1, 2022, Bordeaux, France
Expressions that involve matrices and vectors, known as linear algebra expressions, are commonly evaluated through a sequence of invocations to highly optimised kernels provided in libraries such as BLAS and LAPACK. A sequence of kernels represents a
Externí odkaz:
http://arxiv.org/abs/2207.02070
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) Pages: 924 - 933
Linear algebra operations, which are ubiquitous in machine learning, form major performance bottlenecks. The High-Performance Computing community invests significant effort in the development of architecture-specific optimized kernels, such as those
Externí odkaz:
http://arxiv.org/abs/2202.09888
The Canonical Polyadic (CP) tensor decomposition is frequently used as a model in applications in a variety of different fields. Using jackknife resampling to estimate parameter uncertainties is often desirable but results in an increase of the alrea
Externí odkaz:
http://arxiv.org/abs/2112.03985