activity
20092026
most citedMultilevel Summation for Dispersion: A Linear-Time Algorithm for Potentials

21 citations · 191 across the 67 of their papers we have counts for

collaborators
Showing cs.PFShow all

10 papers · 1 filter

cs.PF2026

Performance Reporting of Mathematical Library Installations with LAAB - An Overview

Aravind Sankaran, Paolo Bientinesi

We present the Linear Algebra Aware Benchmarks (LAAB) framework for systematically assessing and reporting the performance of mathematical library installations on HPC systems. Mat…

cs.PF2024★ 3 cited

Inspection of I/O Operations from System Call Traces using Directly-Follows-Graph

Aravind Sankaran, Ilya Zhukov, Wolfgang Frings +1

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)…

cs.PF2024★ 2 cited

Ranking with Ties based on Noisy Performance Data

Aravind Sankaran, Lars Karlsson, Paolo Bientinesi

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 me…

cs.PF2022★ 1 cited

A Test for FLOPs as a Discriminant for Linear Algebra Algorithms

Aravind Sankaran, Paolo Bientinesi

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 (suc…

cs.PF2022★ 6 cited

FLOPs as a Discriminant for Dense Linear Algebra Algorithms

Francisco López, Lars Karlsson, Paolo Bientinesi

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…

cs.PF2021★ 6 cited

Performance Comparison for Scientific Computations on the Edge via Relative Performance

Aravind Sankaran, Paolo Bientinesi

In a typical Internet-of-Things setting that involves scientific applications, a target computation can be evaluated in many different ways depending on the split of computations a…

cs.PF2020

Discriminating Equivalent Algorithms via Relative Performance

Aravind Sankaran, Paolo Bientinesi

In scientific computing, it is common that a mathematical expression can be computed by many different algorithms (sometimes over hundreds), each identifying a specific sequence of…

cs.PF2015

The ELAPS Framework: Experimental Linear Algebra Performance Studies

Elmar Peise, Paolo Bientinesi

Optimal use of computing resources requires extensive coding, tuning and benchmarking. To boost developer productivity in these time consuming tasks, we introduce the Experimental…

cs.PF2014★ 1 cited

Cache-aware Performance Modeling and Prediction for Dense Linear Algebra

Elmar Peise, Paolo Bientinesi

Countless applications cast their computational core in terms of dense linear algebra operations. These operations can usually be implemented by combining the routines offered by s…

cs.PF2011★ 10 cited

Solving Dense Generalized Eigenproblems on Multi-threaded Architectures

José I. Aliaga, Paolo Bientinesi, Davor Davidović +3

We compare two approaches to compute a portion of the spectrum of dense symmetric definite generalized eigenproblems: one is based on the reduction to tridiagonal form, and the oth…