Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
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 correctn...
Main Authors: | Chen, Jiahao (Contributor), Edelman, Alan (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Mathematics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2017-06-01T20:21:12Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Parallel prefix adder design
by: Choi, Youngmoon
Published: (2008) -
Improved Parallel Prefix on the Multicomputer
by: Jun-yu Ke, et al.
Published: (2009) -
An Algebraic Theory for Formulating Parallel Prefix Algorithms
by: Jei-Zhii Lee, et al.
Published: (1999) -
Generic implementations of parallel prefix sums and its applications
by: Huang, Tao
Published: (2010) -
Constructing of Depth-Size Optimal Parallel Prefix Circuit
by: Chao-Cheng Shih, et al.
Published: (2001)