Folgen
Tze Meng Low
Tze Meng Low
Bestätigte E-Mail-Adresse bei andrew.cmu.edu
Titel
Zitiert von
Zitiert von
Jahr
Analytical modeling is enough for high-performance BLIS
TM Low, FD Igual, TM Smith, ES Quintana-Orti
ACM Transactions on Mathematical Software (TOMS) 43 (2), 1-18, 2016
1742016
The BLIS framework: Experiments in portability
FG Van Zee, TM Smith, B Marker, TM Low, RAVD Geijn, FD Igual, ...
ACM Transactions on Mathematical Software (TOMS) 42 (2), 1-19, 2016
1242016
SPIRAL: Extreme performance portability
F Franchetti, TM Low, DT Popovici, RM Veras, DG Spampinato, ...
Proceedings of the IEEE 106 (11), 1935-1968, 2018
1152018
3D-stacked memory-side acceleration: Accelerator and system design
Q Guo, N Alachiotis, B Akin, F Sadi, G Xu, TM Low, L Pileggi, JC Hoe, ...
2nd Workshop on Near Data Processing, WONDP 2014, 2014
1142014
A unified coded deep neural network training strategy based on generalized polydot codes
S Dutta, Z Bai, H Jeong, TM Low, P Grover
2018 IEEE International Symposium on Information Theory (ISIT), 1585-1589, 2018
1102018
High performance zero-memory overhead direct convolutions
J Zhang, F Franchetti, TM Low
Proceedings of the 35th International Conference on Machine Learning 80 …, 2018
902018
Efficient spmv operation for large and highly sparse matrices using scalable multi-way merge parallelization
F Sadi, J Sweeney, TM Low, JC Hoe, L Pileggi, F Franchetti
Proceedings of the 52nd Annual IEEE/ACM International Symposium on …, 2019
712019
Exploiting symmetry in tensors for high performance: Multiplication with symmetric tensors
MD Schatz, TM Low, RA van de Geijn, TG Kolda
SIAM Journal on Scientific Computing 36 (5), C453-C479, 2014
652014
An API for manipulating matrices stored by blocks
TM Low, RA Van de Geijn, FW Note
Computer Science Department, University of Texas at Austin, 2004
612004
Accumulating Householder transformations, revisited
T Joffrain, TM Low, ES Quintana-Ortí, R Geijn, FGV Zee
ACM Transactions on Mathematical Software (TOMS) 32 (2), 169-179, 2006
562006
Analytical cache modeling and tilesize optimization for tensor contractions
R Li, A Sukumaran-Rajam, R Veras, TM Low, F Rastello, A Rountev, ...
Proceedings of the International Conference for High Performance Computing …, 2019
322019
Scalable parallelization of FLAME code via the workqueuing model
FG Van Zee, P Bientinesi, TM Low, RA Van De Geijn
ACM Transactions on Mathematical Software (TOMS) 34 (2), 2008
312008
Evaluation of graph analytics frameworks using the gap benchmark suite
A Azad, MM Aznaveh, S Beamer, MP Blanco, J Chen, L D'Alessandro, ...
2020 IEEE International Symposium on Workload Characterization (IISWC), 216-227, 2020
292020
CodeNet: Training large scale neural networks in presence of soft-errors
S Dutta, Z Bai, TM Low, P Grover
arXiv preprint arXiv:1903.01042, 2019
272019
First look: Linear algebra-based triangle counting without matrix multiplication
TM Low, VN Rao, M Lee, D Popovici, F Franchetti, S McMillan
2017 IEEE High Performance Extreme Computing Conference (HPEC), 1-6, 2017
262017
FFTX and SpectralPack: A first look
F Franchetti, DG Spampinato, A Kulkarni, DT Popovici, TM Low, ...
2018 IEEE 25th International Conference on High Performance Computing …, 2018
252018
High-assurance SPIRAL: End-to-end guarantees for robot and car control
F Franchetti, TM Low, S Mitsch, JP Mendoza, L Gui, A Phaosawasdi, ...
IEEE Control Systems Magazine 37 (2), 82-103, 2017
252017
Masterless coded computing: A fully-distributed coded FFT algorithm
H Jeong, TM Low, P Grover
2018 56th Annual Allerton Conference on Communication, Control, and …, 2018
242018
Large bandwidth-efficient FFTs on multicore and multi-socket systems
DT Popovici, TM Low, F Franchetti
2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018
242018
Linear algebraic formulation of edge-centric k-truss algorithms with adjacency matrices
TM Low, DG Spampinato, A Kutuluru, U Sridhar, DT Popovici, F Franchetti, ...
2018 IEEE High Performance extreme Computing Conference (HPEC), 1-7, 2018
232018
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20