31 citations · 74 across the 8 of their papers we have counts for
10 papers
TDC: Towards Extremely Efficient CNNs on GPUs via Hardware-Aware Tucker Decomposition
Lizhi Xiang, Miao Yin, Chengming Zhang +4
Tucker decomposition is one of the SOTA CNN model compression techniques. However, unlike the FLOPs reduction, we observe very limited inference time reduction with Tucker-compress…
Efficient distributed algorithms for Convolutional Neural Networks
Rui Li, Yufan Xu, Aravind Sukumaran-Rajam +2
Several efficient distributed algorithms have been developed for matrix-matrix multiplication: the 3D algorithm, the 2D SUMMA algorithm, and the 2.5D algorithm. Each of these algor…
Automated Derivation of Parametric Data Movement Lower Bounds for Affine Programs
Auguste Olivry, Julien Langou, Louis-Noël Pouchet +2
For most relevant computation, the energy and time needed for data movement dominates that for performing arithmetic operations on all computing systems today. Hence it is of criti…
PL-NMF: Parallel Locality-Optimized Non-negative Matrix Factorization
Gordon E. Moon, Aravind Sukumaran-Rajam, Srinivasan Parthasarathy +1
Non-negative Matrix Factorization (NMF) is a key kernel for unsupervised dimension reduction used in a wide range of applications, including topic modeling, recommender systems and…
Load-Balanced Sparse MTTKRP on GPUs
Israt Nisa, Jiajia Li, Aravind Sukumaran-Rajam +2
Sparse matricized tensor times Khatri-Rao product (MTTKRP) is one of the most computationally expensive kernels in sparse tensor computations. This work focuses on optimizing the M…
ATP: Directed Graph Embedding with Asymmetric Transitivity Preservation
Jiankai Sun, Bortik Bandyopadhyay, Armin Bashizade +3
Directed graphs have been widely used in Community Question Answering services (CQAs) to model asymmetric relationships among different types of nodes in CQA graphs, e.g., question…