Cost-Directed Refactoring for Parallel Erlang Programs

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...

Full description

Saved in:
Bibliographic Details
Published in:International journal of parallel programming Vol. 42; no. 4; pp. 564 - 582
Main Authors: Brown, Christopher, Danelutto, Marco, Hammond, Kevin, Kilpatrick, Peter, Elliott, Archibald
Format: Journal Article
Language:English
Published: Boston Springer US 01.08.2014
Springer Nature B.V
Subjects:
Algorithms
Automation
Code reuse
Computer Science
Decisions
Language
Libraries
Mathematical models
Parallel processing
Parallel programming
Processor Architectures
Programmers
Programming
Software Engineering/Programming and Operating Systems
Source programs
Studies
Theory of Computation
Tuning
Function Composition
Chunk Size
Input List
Cost Model
Partition Function
ISSN:0885-7458, 1573-7640
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0885-7458
1573-7640
DOI:10.1007/s10766-013-0266-5