International Journal of Parallel Programming

, Volume 42, Issue 4, pp 564–582

Cost-Directed Refactoring for Parallel Erlang Programs

  • Christopher Brown
  • Marco Danelutto
  • Kevin Hammond
  • Peter Kilpatrick
  • Archibald Elliott
Article

DOI: 10.1007/s10766-013-0266-5

Cite this article as:
Brown, C., Danelutto, M., Hammond, K. et al. Int J Parallel Prog (2014) 42: 564. doi:10.1007/s10766-013-0266-5

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.

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Christopher Brown
    • 1
  • Marco Danelutto
    • 2
  • Kevin Hammond
    • 1
  • Peter Kilpatrick
    • 3
  • Archibald Elliott
    • 1
  1. 1.School of Computer ScienceUniversity of St AndrewsSaint AndrewsScotland, UK
  2. 2.Department of Computer ScienceUniversity of PisaPisaItaly
  3. 3.School of Electronics, Electrical Engineering and Computer ScienceQueen’s UniversityBelfastUK

Personalised recommendations