19 citations · 41 across the 8 of their papers we have counts for
8 papers
Taming Bitwise Behavior in GPU Kernels with Tensor Core: Black-Box Reconstruction, Compiler Enforcement, and Static Verification
Ziteng Yang, Nicholas J. Riasanovsky, Warren Deng +1
Determinism and numerical reproducibility are increasingly required of GPU kernels in machine learning systems, yet deterministic implementations of the same kernel can still diffe…
An Ownership Policy and Deadlock Detector for Promises
Caleb Voss, Vivek Sarkar
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 f…
Task-Graph Scheduling Extensions for Efficient Synchronization and Communication
Seonmyeong Bak, Oscar Hernandez, Mark Gates +2
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-perf…
Advanced Graph-Based Deep Learning for Probabilistic Type Inference
Fangke Ye, Jisheng Zhao, Vivek Sarkar
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 annotatio…
Vyasa: A High-Performance Vectorizing Compiler for Tensor Convolutions on the Xilinx AI Engine
Prasanth Chatarasi, Stephen Neuendorffer, Samuel Bayliss +2
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 cur…
Context-Aware Parse Trees
Fangke Ye, Shengtian Zhou, Anand Venkat +8
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 pro…