Discovering parallel pattern candidates in Erlang

Istvan Bozo, Viktoria Fordos, Zoltan Horvath, Melinda Toth, Daniel Horpacsi, Tamas Kozsik, Judit Koszegi, Adam David Barwell, Christopher Mark Brown, Kevin Hammond

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

The ParaPhrase Refactoring Tool for Erlang (PaRTE) provides automatic, comprehensive and reliable pattern candidate discovery to locate parallelisable components in Erlang programs. It uses semi-automatic and semantics-preserving program transformations to reshape source code and to introduce high level parallel patterns that can be mapped adaptively to the available hardware resources. This paper describes the main PaRTE tools and demonstrates that significant parallel speedups can be obtained.
Original languageEnglish
Title of host publicationErlang '14 Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang
Place of PublicationNew York, NY
PublisherACM
Pages13-23
Number of pages10
ISBN (Print)9781450330381
DOIs
Publication statusPublished - 3 Sept 2014

Keywords

  • Parallelism
  • Patterns
  • Erlang
  • Static Analysis
  • Software engineering
  • Tools

Fingerprint

Dive into the research topics of 'Discovering parallel pattern candidates in Erlang'. Together they form a unique fingerprint.

Cite this