Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
Name
Edelman_Parallel prefix.pdf
Size
490.3 KB
Format
Adobe PDF
Checksum (MD5)
e5910af775a6c33571a69342a26261e2
Author(s)
Chen, Jiahao
Edelman, Alan
Date Issued
March 2015
Journal
2014 First Workshop for High Performance Technical Computing in Dynamic Languages
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
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.
Version
Original manuscript
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.
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/HPTCDL.2014.9
