Listar por autoría "4eeb2085-f242-47ae-82f0-6c88ea5c4680"
-
A Case for Malleable Thread-Level Linear Algebra Libraries: The LU Factorization With Partial Pivoting
IEEE (2019-01)We propose two novel techniques for overcoming load-imbalance encountered when implementing so-called look-ahead mechanisms in relevant dense matrix factorizations for the solution of linear systems. Both techniques target ... -
A complete and efficient CUDA-sharing solution for HPC clusters
Elsevier (2014)In this paper we detail the key features, architectural design, and implementation of rCUDA, an advanced framework to enable remote and transparent GPGPU acceleration in HPC clusters. rCUDA allows decoupling GPUs from ... -
A Data-Parallel ILUPACK for Sparse General and Symmetric Indefinite Linear Systems
Springer (2017-05-28)The solution of sparse linear systems of large dimension is a critical step in problems that span a diverse range of applications. For this reason, a number of iterative solvers have been developed, among which ILUPACK ...
-
A factored variant of the Newton iteration for the solution of algebraic Riccati equations via the matrix sign function
Springer (2013)In this paper we introduce a variant of the Newton iteration for the matrix sign function that results in an efficient numerical solver for a certain class of algebraic Riccati equations (AREs). In particular, when the ...
-
A fast band–Krylov eigensolver for macromolecular functional motion simulation on multicore architectures and graphics processors
Elsevier (2016-03-15)We introduce a new iterative Krylov subspace-based eigensolver for the simulation of macromolecular motions on desktop multithreaded platforms equipped with multicore processors and, possibly, a graphics accelerator (GPU). ...
-
A framework for genomic sequencing on clusters of multicore and manycore processors
Sage (2016-06)The advances in genomic sequencing during the past few years have motivated the development of fast and reliable software for DNA/RNA sequencing on current high performance architectures. Most of these efforts target ...
-
A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU–GPU platforms
Elsevier (2011)We describe a hybrid Lyapunov solver based on the matrix sign function, where the intensive parts of the computation are accelerated using a graphics processor (GPU) while executing the remaining operations on a general-purpose ...
-
A Parallel Multi-threaded Solver for Symmetric Positive Definite Bordered-Band Linear Systems
Springer (2016-04)We present a multi-threaded solver for symmetric positive definite linear systems where the coefficient matrix of the problem features a bordered-band non-zero pattern. The algorithms that implement this approach heavily ...
-
A parallel solver for huge dense linear systems
Elsevier (2011-11)HDSS (Huge Dense Linear System Solver) is a Fortran Application Programming Interface (API) to facilitate the parallel solution of very large dense systems to scientists and engineers. The API makes use of parallelism to ...
-
A Proposal to Extend the OpenMP Tasking Model for Heterogeneous Architectures
Springer Berlin Heidelberg (2009)OpenMP has evolved recently towards expressing unstructured parallelism, targeting the parallelization of a broader range of applications in the current multicore era. Homogeneous multicore architectures from major vendors ...
-
A Runtime System for Programming Out-of-Core Matrix Algorithms-by-Tiles on Multithreaded Architectures
ACM (2012-08)Out-of-core implementations of algorithms for dense matrix computations have traditionally focused on optimal use of memory so as to minimize I/O, often trading programmability for performance. In this article we show how ...
-
A simulator to assess energy saving strategies and policies in HPC workloads
Association for Computing Machinery (ACM) (2012-07)In recent years power consumption of high performance computing (HPC) clusters has become a growing problem due, e.g., to the economic cost of electricity, the emission of car- bon dioxide (with negative impact on the ...
-
Accelerating BST Methods for Model Reduction with Graphics Processors
Springer Berlin Heidelberg (2012)Model order reduction of dynamical linear time-invariant system appears in many scientific and engineering applications. Numerically reliable SVD-based methods for this task require O(n3) floating-point arithmetic operations, ...
-
Accelerating Model Reduction of Large Linear Systems with Graphics Processors
Springer Berlin Heidelberg (2012)Model order reduction of a dynamical linear time-invariant system appears in many applications from science and engineering. Numerically reliable SVD-based methods for this task require in general O(n3) floating-point ...
-
Accelerating multi-channel filtering of audio signal on ARM processors
Springer Verlag (2016-03)
-
Accelerating the Lyapack library using GPUs
Springer (2013)Lyapack is a package for the solution of large-scale sparse problems arising in control theory. The package has a modular design, and is implemented as a Matlab toolbox, which renders it easy to utilize, modify and extend ...
-
Accelerating the SRP-PHAT algorithm on multi- and many-core platforms using OpenCL
Springer (2019-03)The Steered Response Power with Phase Transform (SRP-PHAT) algorithm is a well-known method for sound source localization due to its robust performance in noisy and reverberant environments. This algorithm is used in a ...
-
Accelerating the task/data-parallel version of ILUPACK’s BiCG in multi-CPU/GPU configurations
Elsevier (2019)ILUPACK is a valuable tool for the solution of sparse linear systems via iterative Krylov subspace-based methods. Its relevance for the solution of real problems has motivated several efforts to enhance its performance on ...
-
Accelerating urban scale simulations leveraging local spatial 3D structure
Elsevier (2022-06-15)This paper presents a hybrid methodology for accelerating Computational Fluid Dynamics (CFD) simulations intertwining inferences from deep neural networks (DNN). The strategy leverages the local spatial data of the velocity ...
-
Acceleration of PageRank with Customized Precision Based on Mantissa Segmentation
Association for Computing Machinery (ACM) (2020-03)We describe the application of a communication-reduction technique for the PageRank algorithm that dynamically adapts the precision of the data access to the numerical requirements of the algorithm as the iteration converges. ...
