Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques

Christopher Mark Brown; Kevin Hammond; Hans-Wolfgang Loidl

Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques

Christopher Mark Brown, Kevin Hammond, Hans-Wolfgang Loidl

Research output: Contribution to conference › Paper › peer-review

Abstract

Enabling programmers to "think parallel'' is critical if we are to be able to effectively exploit future multicore/manycore architectures.
This paper introduces paraforming: a new approach to constructing parallel functional programs using formally-defined refactoring transformations.
We introduce a number of new refactorings for Parallel Haskell that capture common parallel abstractions, such as divide-and-conquer
and data parallelism,
and show how these can be used by the HaRe Haskell refactoring engine. Using a paraforming approach, we are able to easily obtain
significant and scalable speedups
(up to 7.8 on an 8-core machine).

Original language	English
Number of pages	16
Publication status	Published - 1 Oct 2011
Event	12th Symposium on Trends in Functional Programming - Madrid, Spain Duration: 16 May 2011 → 18 May 2011

Conference

Conference	12th Symposium on Trends in Functional Programming
Country/Territory	Spain
City	Madrid
Period	16/05/11 → 18/05/11

Keywords

Refactoring
Parallelism
Haskell
HaRe
Paraforming
Paraphrase
GpH

Cite this

@conference{c38c12281fd24e088e1ccf0f07fc2f8e,

title = "Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques",

abstract = "Enabling programmers to {"}think parallel'' is critical if we are to be able to effectively exploit future multicore/manycore architectures. This paper introduces paraforming: a new approach to constructing parallel functional programs using formally-defined refactoring transformations. We introduce a number of new refactorings for Parallel Haskell that capture common parallel abstractions, such as divide-and-conquer and data parallelism, and show how these can be used by the HaRe Haskell refactoring engine. Using a paraforming approach, we are able to easily obtain significant and scalable speedups (up to 7.8 on an 8-core machine).",

keywords = "Refactoring, Parallelism, Haskell, HaRe, Paraforming, Paraphrase, GpH",

author = "Brown, \{Christopher Mark\} and Kevin Hammond and Hans-Wolfgang Loidl",

year = "2011",

month = oct,

day = "1",

language = "English",

note = "12th Symposium on Trends in Functional Programming ; Conference date: 16-05-2011 Through 18-05-2011",

}

TY - CONF

T1 - Paraforming

T2 - 12th Symposium on Trends in Functional Programming

AU - Brown, Christopher Mark

AU - Hammond, Kevin

AU - Loidl, Hans-Wolfgang

PY - 2011/10/1

Y1 - 2011/10/1

N2 - Enabling programmers to "think parallel'' is critical if we are to be able to effectively exploit future multicore/manycore architectures. This paper introduces paraforming: a new approach to constructing parallel functional programs using formally-defined refactoring transformations. We introduce a number of new refactorings for Parallel Haskell that capture common parallel abstractions, such as divide-and-conquer and data parallelism, and show how these can be used by the HaRe Haskell refactoring engine. Using a paraforming approach, we are able to easily obtain significant and scalable speedups (up to 7.8 on an 8-core machine).

AB - Enabling programmers to "think parallel'' is critical if we are to be able to effectively exploit future multicore/manycore architectures. This paper introduces paraforming: a new approach to constructing parallel functional programs using formally-defined refactoring transformations. We introduce a number of new refactorings for Parallel Haskell that capture common parallel abstractions, such as divide-and-conquer and data parallelism, and show how these can be used by the HaRe Haskell refactoring engine. Using a paraforming approach, we are able to easily obtain significant and scalable speedups (up to 7.8 on an 8-core machine).

KW - Refactoring

KW - Parallelism

KW - Haskell

KW - HaRe

KW - Paraforming

KW - Paraphrase

KW - GpH

M3 - Paper

Y2 - 16 May 2011 through 18 May 2011

ER -

Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques

Abstract

Conference

Keywords

Fingerprint

Cite this