Closing a Source Complexity Gap between Chapel and HPX
Shreyas Atre, Chris Taylor, Patrick Diehl, Hartmut Kaiser

TL;DR
This paper explores reducing the source-code complexity gap between Chapel and HPX by using a source-to-source compiler, comparing their performance on Arm and x86 architectures.
Contribution
It introduces a source-to-source compiler approach to bridge the complexity gap between Chapel and HPX, with initial performance assessments.
Findings
Chapel and HPX show similar performance and complexity
Performance evaluated on Arm and x86 architectures
Initial results suggest potential for complexity reduction
Abstract
A previous case study measured performance vs source-code complexity across multiple languages. The case study identified Chapel and HPX provide similar performance and code complexity. This paper is the result of initial steps toward closing the source-code complexity gap between Chapel and HPX by using a source-to-source compiler. The investigation assesses the single-machine performance of both Chapel and Chplx applications across Arm and x86.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Distributed and Parallel Computing Systems
