Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof

Author(s)
Chen, Jiahao; Edelman, Alan
Thumbnail
DownloadEdelman_Parallel prefix.pdf (490.3Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2015-03
URI
http://hdl.handle.net/1721.1/109518
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory; Massachusetts Institute of Technology. Department of Mathematics
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
ISBN
978-1-4799-7020-9
Collections