33 citations · 86 across the 11 of their papers we have counts for
11 papers
PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks
Kartik Lakhotia, Laura Monroe, Kelly Isham +4
We present PolarStar, a novel family of diameter-3 network topologies derived from the star product of low-diameter factor graphs. PolarStar gives the largest known diameter-3 netw…
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…
PolarFly: A Cost-Effective and Flexible Low-Diameter Topology
Kartik Lakhotia, Maciej Besta, Laura Monroe +4
In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is a highly scalable low-diameter top…
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…
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…
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…
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…
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…
An Efficient Shared-memory Parallel Sinkhorn-Knopp Algorithm to Compute the Word Mover's Distance
Jesmin Jahan Tithi, Fabrizio Petrini
The Word Mover's Distance (WMD) is a metric that measures the semantic dissimilarity between two text documents by computing the cost of moving all words of a source/query document…
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…
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…