Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
Author(s)Chen, Jiahao; Edelman, Alan
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Mathematics
2014 First Workshop for High Performance Technical Computing in Dynamic Languages
Institute of Electrical and Electronics Engineers (IEEE)
Chen, Jiahao, and Alan Edelman. “Parallel Prefix Polymorphism Permits Parallelization, Presentation Proof.” 2014 First Workshop for High Performance Technical Computing in Dynamic Languages, 17 November, 2014, New Orleans, LA, USA, IEEE, 2014. 47–56.