Zobrazeno 1 - 10
of 324
pro vyhledávání: '"Sarkar, Vivek"'
Autor:
Emery, Brett, Snapp, Kelsey L., Revier, Daniel, Sarkar, Vivek, Nakura, Masa, Brown, Keith A., Lipton, Jeffrey Ian
Foams are versatile by nature and ubiquitous in a wide range of applications, including padding, insulation, and acoustic dampening. Previous work established that foams 3D printed via Viscous Thread Printing (VTP) can in principle combine the flexib
Externí odkaz:
http://arxiv.org/abs/2407.06051
Autor:
Hayashi, Akihiro, Adams, Austin, Young, Jeffrey, McCaskey, Alexander, Dumitrescu, Eugene, Sarkar, Vivek, Conte, Thomas M.
In this paper, we address some of the key limitations to realizing a generic heterogeneous parallel programming model for quantum-classical heterogeneous platforms. We discuss our experience in enabling user-level multi-threading in QCOR as well as c
Externí odkaz:
http://arxiv.org/abs/2301.11559
This paper introduces a novel approach to automatic ahead-of-time (AOT) parallelization and optimization of sequential Python programs for execution on distributed heterogeneous platforms. Our approach enables AOT source-to-source transformation of P
Externí odkaz:
http://arxiv.org/abs/2203.06233
The PGAS model is well suited for executing irregular applications on cluster-based systems, due to its efficient support for short, one-sided messages. However, there are currently two major limitations faced by PGAS applications. The first relates
Externí odkaz:
http://arxiv.org/abs/2107.05516
Autor:
Voss, Caleb, Sarkar, Vivek
Publikováno v:
Principles and Practice of Parallel Programming, 2021, ACM, pp. 348-361
Task-parallel programs often enjoy deadlock freedom under certain restrictions, such as the use of structured join operations, as in Cilk and X10, or the use of asynchronous task futures together with deadlock-avoiding policies such as Known Joins or
Externí odkaz:
http://arxiv.org/abs/2101.01312
Task graphs have been studied for decades as a foundation for scheduling irregular parallel applications and incorporated in programming models such as OpenMP. While many high-performance parallel libraries are based on task graphs, they also have ad
Externí odkaz:
http://arxiv.org/abs/2011.03196
Dynamically typed languages such as JavaScript and Python have emerged as the most popular programming languages in use. Important benefits can accrue from including type annotations in dynamically typed programs. This approach to gradual typing is e
Externí odkaz:
http://arxiv.org/abs/2009.05949
Autor:
Ye, Fangke, Zhou, Shengtian, Venkat, Anand, Marcus, Ryan, Tatbul, Nesime, Tithi, Jesmin Jahan, Hasabnis, Niranjan, Petersen, Paul, Mattson, Timothy, Kraska, Tim, Dubey, Pradeep, Sarkar, Vivek, Gottschlich, Justin
Code semantics similarity can be used for many tasks such as code recommendation, automated software defect correction, and clone detection. Yet, the accuracy of such systems has not yet reached a level of general purpose reliability. To help address
Externí odkaz:
http://arxiv.org/abs/2006.05265
Xilinx's AI Engine is a recent industry example of energy-efficient vector processing that includes novel support for 2D SIMD datapaths and shuffle interconnection network. The current approach to programming the AI Engine relies on a C/C++ API for v
Externí odkaz:
http://arxiv.org/abs/2006.01331
Autor:
Ye, Fangke, Zhou, Shengtian, Venkat, Anand, Marcus, Ryan, Petersen, Paul, Tithi, Jesmin Jahan, Mattson, Tim, Kraska, Tim, Dubey, Pradeep, Sarkar, Vivek, Gottschlich, Justin
The simplified parse tree (SPT) presented in Aroma, a state-of-the-art code recommendation system, is a tree-structured representation used to infer code semantics by capturing program \emph{structure} rather than program \emph{syntax}. This is a dep
Externí odkaz:
http://arxiv.org/abs/2003.11118