DocumentCode :
3582325
Title :
Parallel Prefix Polymorphism Permits Parallelization, Presentation & Proof
Author :
Jiahao Chen ; Edelman, Alan
Author_Institution :
Comput. Sci. & Artificial Intell. Lab., Massachusetts Inst. of Technol., Cambridge, MA, USA
fYear :
2014
Firstpage :
47
Lastpage :
56
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.
Keywords :
data flow analysis; data visualisation; parallel languages; parallel programming; program verification; codebase reuse; distributed computing; formal verification; parallel prefix polymorphism; parallel program verification; parallelization; programming languages; runtime data flow visualization; technical computing; Algorithm design and analysis; Arrays; Computer languages; Data visualization; Instruments; Kernel; Syntactics; Julia; prefix sum; scan; parallel prefix; polymorphism; instrumentation; visualization;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
High Performance Technical Computing in Dynamic Languages (HPTCDL), 2014 First Workshop for
Type :
conf
DOI :
10.1109/HPTCDL.2014.9
Filename :
7069904
Link To Document :
بازگشت