activity
20162023
most citedALTO: Adaptive Linearized Storage of Sparse Tensors

33 citations · 86 across the 11 of their papers we have counts for

collaborators
Showing cs.DCShow all

8 papers · 1 filter

cs.DC2022★ 4 cited

Ridgeline: A 2D Roofline Model for Distributed Systems

Fabio Checconi, Jesmin Jahan Tithi, Fabrizio Petrini

In this short paper, we introduce the Ridgeline model, an extension of the Roofline model [4] for distributed systems. The Roofline model targets shared memory systems, bounding th…

cs.DC2022

Efficient, Out-of-Memory Sparse MTTKRP on Massively Parallel Architectures

Andy Nguyen, Ahmed E. Helal, Fabio Checconi +6

Tensor decomposition (TD) is an important method for extracting latent information from high-dimensional (multi-modal) sparse data. This study presents a novel framework for accele…

cs.DC2021

A New Parallel Algorithm for Sinkhorn Word-Movers Distance and Its Performance on PIUMA and Xeon CPU

Jesmin Jahan Tithi, Fabrizio Petrini

The Word Movers Distance (WMD) measures the semantic dissimilarity between two text documents by computing the cost of optimally moving all words of a source/query document to the…

cs.DC2021

Performance Optimization of SU3_Bench on Xeon and Programmable Integrated Unified Memory Architecture

Jesmin Jahan Tithi, Fabio Checconi, Douglas Doerfler +1

SU3\_Bench is a microbenchmark developed to explore performance portability across multiple programming models/methodologies using a simple, but nontrivial, mathematical kernel. Th…

cs.DC2021★ 33 cited

ALTO: Adaptive Linearized Storage of Sparse Tensors

Ahmed E. Helal, Jan Laukemann, Fabio Checconi +4

The analysis of high-dimensional sparse data is becoming increasingly popular in many important domains. However, real-world sparse tensors are challenging to process due to their…

cs.DC2020★ 1 cited

Mapping Stencils on Coarse-grained Reconfigurable Spatial Architecture

Jesmin Jahan Tithi, Fabrizio Petrini, Hongbo Rong +2

Stencils represent a class of computational patterns where an output grid point depends on a fixed shape of neighboring points in an input grid. Stencil computations are prevalent…

cs.DC2020

Online and Real-time Object Tracking Algorithm with Extremely Small Matrices

Jesmin Jahan Tithi, Sriram Aananthakrishnan, Fabrizio Petrini

Online and Real-time Object Tracking is an interesting workload that can be used to track objects (e.g., car, human, animal) in a series of video sequences in real-time. For simple…

cs.DC2016★ 10 cited

Subgraph Counting: Color Coding Beyond Trees

Venkatesan T. Chakaravarthy, Michael Kapralov, Prakash Murali +4

The problem of counting occurrences of query graphs in a large data graph, known as subgraph counting, is fundamental to several domains such as genomics and social network analysi…