Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Aravind Sukumaran-Rajam"'
Autor:
Xiaojing An, Priyanka Ghosh, Patrick Keppler, Sureyya Emre Kurt, Sriram Krishnamoorthy, Ponnuswamy Sadayappan, Aravind Sukumaran Rajam, Ümit V. Çatalyürek, Ananth Kalyanaraman
Publikováno v:
iScience, Vol 25, Iss 11, Pp 105273- (2022)
Summary: De novo genome assembly is a fundamental problem in computational molecular biology that aims to reconstruct an unknown genome sequence from a set of short DNA sequences (or reads) obtained from the genome. The relative ordering of the reads
Externí odkaz:
https://doaj.org/article/0651a4b847574ae3a77a993418f600bf
Autor:
Dwaipayan Choudhury, Reet Barik, Aravind Sukumaran Rajam, Ananth Kalyanaraman, Partha Pratim Pande
Publikováno v:
ACM Transactions on Design Automation of Electronic Systems. 27:1-22
Manycore GPU architectures have become the mainstay for accelerating graph computations. One of the primary bottlenecks to performance of graph computations on manycore architectures is the data movement. Since most of the accesses in graph processin
Publikováno v:
Proceedings of the International Conference on Parallel Architectures and Compilation Techniques.
Publikováno v:
Proceedings of the International Conference on Parallel Architectures and Compilation Techniques.
Publikováno v:
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS).
Publikováno v:
2022 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
Publikováno v:
Proceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction.
Training models with massive inputs is a significant challenge in the development of Deep Learning pipelines to process very large digital image datasets as required by Whole Slide Imaging (WSI) in computational pathology and analysis of brain fMRI i
Publikováno v:
SC
Subgraph isomorphism is a pattern-matching algorithm widely used in many domains such as chem-informatics, bioinformatics, databases, and social network analysis. It is computationally expensive and is a proven NP-hard problem. The massive parallelis
Publikováno v:
SPAA
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 algorithms was independently conceived and they trade-off memory needed per
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::71409b21f1edcbb051b5f51625968ffe
http://arxiv.org/abs/2105.13480
http://arxiv.org/abs/2105.13480
Autor:
Prashant Singh Rawat, Atanas Rountev, Mahesh Ravishankar, P. Sadayappan, Vinod Grover, Aravind Sukumaran-Rajam, Miheer Vaidya, Louis-Noël Pouchet
Publikováno v:
Proceedings of the IEEE. 106:1902-1920
Stencil computations arise in a number of computational domains. They exhibit significant data parallelism and are thus well suited for execution on graphical processing units (GPUs), but can be memory-bandwidth limited unless temporal locality is ut