REVIEW 3 cited by
Effective Extensible Programming: Unleashing Julia on GPUs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
GPUs and other accelerators are popular devices for accelerating compute-intensive, parallelizable applications. However, programming these devices is a difficult task. Writing efficient device code is challenging, and is typically done in a low-level programming language. High-level languages are rarely supported, or do not integrate with the rest of the high-level language ecosystem. To overcome this, we propose compiler infrastructure to efficiently add support for new hardware or environments to an existing programming language. We evaluate our approach by adding support for NVIDIA GPUs to the Julia programming language. By integrating with the existing compiler, we significantly lower the cost to implement and maintain the new compiler, and facilitate reuse of existing application code. Moreover, use of the high-level Julia programming language enables new and dynamic approaches for GPU programming. This greatly improves programmer productivity, while maintaining application performance similar to that of the official NVIDIA CUDA toolkit.
Forward citations
Cited by 3 Pith papers
-
Optimal Kron-based Reduction of Networks (Opti-KRON) for Three-phase Distribution Feeders
A Kron-reduction framework for unbalanced three-phase distribution feeders selects which nodes to merge via optimization, achieving up to ~90% reduction with voltage error below 0.003 p.u.
-
Universal non-equilibrium scaling of cumulants across a critical point
The paper extracts universal non-equilibrium scaling functions for the order parameter and its cumulants up to fourth order in a Z2 scalar field theory with Model A dynamics in two and three dimensions.
-
Programming guide for solving constraint satisfaction problems with tensor networks
This guide demonstrates how to use the Julia packages GenericTensorNetworks.jl, OMEinsum.jl, and ProblemReductions.jl to represent constraint satisfaction problems as tensor networks, optimize contraction orders, and ...
Discussion (0). Continue with ORCID to comment.