Cost-directed refactoring for parallel Erlang programs

26Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents a new programming methodology for introducing and tuning parallelism in Erlang programs, using source-level code refactoring from sequential source programs to parallel programs written using our skeleton library, Skel. High-level cost models allow us to predict with reasonable accuracy the parallel performance of the refactored program, enabling programmers to make informed decisions about which refactorings to apply. Using our approach, we demonstrate easily obtainable, significant and scalable speedups of up to 21 on a 24-core machine over the sequential code. © 2013 Springer Science+Business Media New York.

Cite

CITATION STYLE

APA

Brown, C., Danelutto, M., Hammond, K., Kilpatrick, P., & Elliott, A. (2014). Cost-directed refactoring for parallel Erlang programs. International Journal of Parallel Programming, 42(4), 564–582. https://doi.org/10.1007/s10766-013-0266-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free