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

doi:10.1145/2633448.2633453

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 proceeding › Conference contribution

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 language	English
Title of host publication	Erlang '14 Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang
Place of Publication	New York, NY
Publisher	ACM
Pages	13-23
Number of pages	10
ISBN (Print)	9781450330381
DOIs	https://doi.org/10.1145/2633448.2633453
Publication status	Published - 3 Sept 2014

Keywords

Parallelism
Patterns
Erlang
Static Analysis
Software engineering
Tools

Access to Document

10.1145/2633448.2633453

Cite this

@inproceedings{33d1794fefbe4d6da07ed04a74f8c7c1,

title = "Discovering parallel pattern candidates in Erlang",

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

keywords = "Parallelism, Patterns, Erlang, Static Analysis, Software engineering, Tools",

author = "Istvan Bozo and Viktoria Fordos and Zoltan Horvath and Melinda Toth and Daniel Horpacsi and Tamas Kozsik and Judit Koszegi and Barwell, {Adam David} and Brown, {Christopher Mark} and Kevin Hammond",

year = "2014",

month = sep,

day = "3",

doi = "10.1145/2633448.2633453",

language = "English",

isbn = "9781450330381",

pages = "13--23",

booktitle = "Erlang '14 Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang",

publisher = "ACM",

address = "United States",

}

TY - GEN

T1 - Discovering parallel pattern candidates in Erlang

AU - Bozo, Istvan

AU - Fordos, Viktoria

AU - Horvath, Zoltan

AU - Toth, Melinda

AU - Horpacsi, Daniel

AU - Kozsik, Tamas

AU - Koszegi, Judit

AU - Barwell, Adam David

AU - Brown, Christopher Mark

AU - Hammond, Kevin

PY - 2014/9/3

Y1 - 2014/9/3

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

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

KW - Parallelism

KW - Patterns

KW - Erlang

KW - Static Analysis

KW - Software engineering

KW - Tools

UR - http://dl.acm.org/citation.cfm?id=2633453

U2 - 10.1145/2633448.2633453

DO - 10.1145/2633448.2633453

M3 - Conference contribution

SN - 9781450330381

SP - 13

EP - 23

BT - Erlang '14 Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang

PB - ACM

CY - New York, NY

ER -

Discovering parallel pattern candidates in Erlang

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

ParaPhrase FP7-ICT-2011-7: EU FP7 'ParaPhrase'

FP7 ADVANCE: EU FP7 'Asynchronous and Dynamic Virtualisation through performance Analysis to support Concurrency Engineering 'ADVANCE'

HPC-GAP: High performance computational: HPC-GAP High Performance Computational Algebra and Discrete Mathematics

Christopher Mark Brown

Cite this

Discovering parallel pattern candidates in Erlang

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Projects

ParaPhrase FP7-ICT-2011-7: EU FP7 'ParaPhrase'

FP7 ADVANCE: EU FP7 'Asynchronous and Dynamic Virtualisation through performance Analysis to support Concurrency Engineering 'ADVANCE'

HPC-GAP: High performance computational: HPC-GAP High Performance Computational Algebra and Discrete Mathematics

Profiles

Christopher Mark Brown

Cite this