Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques

Christopher Mark Brown, Kevin Hammond, Hans-Wolfgang Loidl

Research output: Contribution to conferencePaperpeer-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 languageEnglish
Number of pages16
Publication statusPublished - 1 Oct 2011
Event12th Symposium on Trends in Functional Programming - Madrid, Spain
Duration: 16 May 201118 May 2011

Conference

Conference12th Symposium on Trends in Functional Programming
Country/TerritorySpain
CityMadrid
Period16/05/1118/05/11

Keywords

  • Refactoring
  • Parallelism
  • Haskell
  • HaRe
  • Paraforming
  • Paraphrase
  • GpH

Fingerprint

Dive into the research topics of 'Paraforming: Forming Parallel Haskell Programs Using Novel Refactoring Techniques'. Together they form a unique fingerprint.

Cite this