Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Mayank Daga"'
Autor:
Mayank Daga, Daniel Lowell, Jing Zhang, Michael Melesse, Ilya Perminov, Kamil Nasyrov, Artem Tamazov, Paul Fultz, Bragadeesh Natarajan, Vasilii Filippov, Jehandad Khan, Jing Zhou, Murali Nandhimandalam, Tejash Shah, Chao Liu
Publikováno v:
Scopus-Elsevier
Deep Learning has established itself to be a common occurrence in the business lexicon. The unprecedented success of deep learning in recent years can be attributed to: an abundance of data, availability of gargantuan compute capabilities offered by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1745cd7ee989687d8ec7984f8962c07d
http://arxiv.org/abs/1910.00078
http://arxiv.org/abs/1910.00078
Autor:
Mayank Daga
Publikováno v:
High Performance Computing for Computational Science – VECPAR 2016 ISBN: 9783319619811
VECPAR
VECPAR
Graphics Processing Units (GPUs) have fundamentally altered the approach to parallel computing despite the substantial PCIe overheads that they manifest. In order to maximize performance-per-dollar, systems are now being deployed with multiple GPUs i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aedda0b5f4aff7eb7001815d5a1833a9
https://doi.org/10.1007/978-3-319-61982-8_12
https://doi.org/10.1007/978-3-319-61982-8_12
Publikováno v:
BCB
The timescales and structure sizes accessible via simulations of atomistic molecular dynamics (MD) can be advanced substantially by two independent techniques: (1) many-core parallelization with graphics processing units (GPUs) and (2) multiscale app
Publikováno v:
IWOCL
Sparse linear algebra is a cornerstone of modern computational science. These algorithms ignore the zero-valued entries found in many domains in order to work on much larger problems at much faster rates than dense algorithms. Nonetheless, optimizing
Autor:
Wei Wu, Sooraj Puthoor, Bradford M. Beckmann, Shuai Che, Mayank Daga, Gregory Rodgers, Ashwin M. Aji
Publikováno v:
GPGPU@PPoPP
Achieving optimal performance on heterogeneous computing systems requires a programming model that supports the execution of asynchronous, multi-stream, and out-of-order tasks in a shared memory environment. Asynchronous dependency-driven tasking is
Publikováno v:
Journal of Chemical Theory and Computation. 7:544-559
Molecular dynamics (MD) simulations based on the generalized Born (GB) model of implicit solvation offer a number of important advantages over the traditional explicit solvent based simulations. Yet, in MD simulations, the GB model has not been able
Publikováno v:
IISWC
Parallel systems that employ CPUs and GPUs as two heterogeneous computational units have become immensely popular due to their ability to maximize performance under restrictive thermal budgets. However, programming heterogeneous systems via tradition
Publikováno v:
IPDPS Workshops
Graphics processing units (GPUs) have delivered promising speedups in data-parallel applications. A discrete GPU resides on the PCIe interface and has traditionally required data to be moved from the host memory to the GPU memory via PCIe. In certain
Autor:
Joseph L. Greathouse, Mayank Daga
Publikováno v:
SC
The performance of sparse matrix vector multiplication (SpMV) is important to computational scientists. Compressed sparse row (CSR) is the most frequently used format to store sparse matrices. However, CSR-based SpMV on graphics processing units (GPU
Publikováno v:
BigData Conference
Accelerating breadth-first search (BFS) can be a compelling value-add given its pervasive deployment. The current state-of-the-art hybrid BFS algorithm selects different traversal directions based on graph properties, thereby, possessing heterogeneou