Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
Jiahao Chen, Alan Edelman
TL;DR
This paper demonstrates that polymorphism can be leveraged beyond traditional code reuse to enable parallelism, visualization, and formal verification, offering new insights into parallel program understanding and correctness.
Contribution
It introduces a novel approach to applying polymorphism for parallelization, visualization, and proof, expanding its utility beyond conventional programming paradigms.
Findings
Polymorphism facilitates parallel execution in distributed systems.
It enables effective visualization of runtime data flow.
Polymorphism supports formal verification of program correctness.
Abstract
Polymorphism in programming languages enables code reuse. Here, we show that polymorphism has broad applicability far beyond computations for technical computing: parallelism in distributed computing, presentation of visualizations of runtime data flow, and proofs for formal verification of correctness. The ability to reuse a single codebase for all these purposes provides new ways to understand and verify parallel programs.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScientific Computing and Data Management · Parallel Computing and Optimization Techniques · Distributed and Parallel Computing Systems