Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Penporn Koanantakool"'
Autor:
Aart Bik, Penporn Koanantakool, Tatiana Shpeisman, Nicolas Vasilache, Bixia Zheng, Fredrik Kjolstad
Sparse tensors arise in problems in science, engineering, machine learning, and data analytics. Programs that operate on such tensors can exploit sparsity to reduce storage requirements and computational time. Developing and maintaining sparse softwa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::240af2686d1b9c1c39037f1695d1d54e
http://arxiv.org/abs/2202.04305
http://arxiv.org/abs/2202.04305
Autor:
Gerald Friedland, Eric Battenberg, Penporn Koanantakool, Michael Driscoll, Ekaterina Gonina, Kurt Keutzer, Evangelos Georganas
Publikováno v:
ACM Transactions on Multimedia Computing, Communications, and Applications. 10:1-22
In this new era dominated by consumer-produced media there is a high demand for web-scalable solutions to multimedia content analysis. A compelling approach to making applications scalable is to explicitly map their computation onto parallel platform
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8b70d50ac98e3c591b65ed5c51140852
https://doi.org/10.1145/2517151
https://doi.org/10.1145/2517151
Autor:
Katherine Yelick, Leonid Oliker, Ariful Azad, Aydin Buluc, Sang-Yun Oh, Penporn Koanantakool, Dmitriy Morozov
Publikováno v:
IPDPS
Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::42385d4661db5f47c1a7792b052a81d1
https://doi.org/10.1109/ipdps.2016.117
https://doi.org/10.1109/ipdps.2016.117
Autor:
Nicholas Knight, James Demmel, Laura Grigori, Penporn Koanantakool, Oded Schwartz, Erin Carson, Harsha Vardhan Simhadri
Publikováno v:
IPDPS
Proceedings of IEEE International Parallel & Distributed Processing Symposium, IPDPS 2016
Proceedings of IEEE International Parallel & Distributed Processing Symposium, IPDPS 2016, 2016, Chicago, United States
Proceedings of IEEE International Parallel & Distributed Processing Symposium, IPDPS 2016
Proceedings of IEEE International Parallel & Distributed Processing Symposium, IPDPS 2016, 2016, Chicago, United States
Communication, i.e., moving data between levels of a memory hierarchy or between processors over a network, is much more expensive (in time or energy) than arithmetic. There has thus been a recent focus on designing algorithms that minimize communica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24670a7bbda2f74662f82cf04a2dcbae
https://doi.org/10.1109/ipdps.2016.114
https://doi.org/10.1109/ipdps.2016.114
Autor:
Penporn Koanantakool, Katherine Yelick
Publikováno v:
SC
International Conference for High Performance Computing, Networking, Storage and Analysis, SC, vol 2015-January, iss January
International Conference for High Performance Computing, Networking, Storage and Analysis, SC, vol 2015-January, iss January
Traditional particle simulation methods are used to calculate pair wise potentials, but some problems require 3-body potentials that calculate over triplets of particles. A direct calculation of 3-body interactions involves O(n3) interactions, but ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::38968e1224d42b069b59f4b000d95f85
https://doi.org/10.1109/sc.2014.35
https://doi.org/10.1109/sc.2014.35
Autor:
Penporn Koanantakool, Katherine Yelick, Edgar Solomonik, Michael Driscoll, Evangelos Georganas
Publikováno v:
IPDPS
We consider the problem of communication avoidance in computing interactions between a set of particles in scenarios with and without a cutoff radius for interaction. Our strategy, which we show to be optimal in communication, divides the work in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d91e973e82fe39c3e0010b53ae0b8f50
https://doi.org/10.1109/ipdps.2013.108
https://doi.org/10.1109/ipdps.2013.108