University of Hertfordshire

By the same authors

A Case Study in Coordination Programming: S-Net vs Concurrent Collection

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

Standard

A Case Study in Coordination Programming: S-Net vs Concurrent Collection. / Zaichenkov, Pavel ; Gijsbers, Bert ; Grelck, Clemens; Tveretina, Olga; Shafarenko, Alex.

Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures . Vol. 2015 2014. 376317.

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

Harvard

Zaichenkov, P, Gijsbers, B, Grelck, C, Tveretina, O & Shafarenko, A 2014, A Case Study in Coordination Programming: S-Net vs Concurrent Collection. in Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures . vol. 2015, 376317, Workshop on Programming Models, Languages and Compilers for Manycore and Heterogeneous Architectures (PLC'14), Phoenix, United States, 19/05/14.

APA

Zaichenkov, P., Gijsbers, B., Grelck, C., Tveretina, O., & Shafarenko, A. (2014). A Case Study in Coordination Programming: S-Net vs Concurrent Collection. In Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures (Vol. 2015). [376317]

Vancouver

Zaichenkov P, Gijsbers B, Grelck C, Tveretina O, Shafarenko A. A Case Study in Coordination Programming: S-Net vs Concurrent Collection. In Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures . Vol. 2015. 2014. 376317

Author

Zaichenkov, Pavel ; Gijsbers, Bert ; Grelck, Clemens ; Tveretina, Olga ; Shafarenko, Alex. / A Case Study in Coordination Programming: S-Net vs Concurrent Collection. Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures . Vol. 2015 2014.

Bibtex

@inproceedings{c8dc317882ce4aa1832f0e6ef32a4074,
title = "A Case Study in Coordination Programming: S-Net vs Concurrent Collection",
abstract = "We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-NETwith Intel’s Concurrent Collections (CnC). As a coordination language S-NETachieves a near-complete separation of concerns between sequential software components implemented in a separate algorithmic language and their parallel orchestration in an asynchronous data flow streaming network.We investigate the merits of S-NET and CnC with the help of a relevant and non-trivial linear algebra problem: tiled Cholesky decomposition. We describe two alternativeS-NET implementations of tiled Cholesky factorization and compare them with two CnC implementations, one with explicit performance tuning and one without, that have previously been used to illustrate Intel CnC. Our experiments on a 48-coremachine demonstrate that S-NET manages to outperform CnCon this problem.",
keywords = "performance measurement; coordination pro- gramming; stream processing; concurrent collections; parallel programming; language design",
author = "Pavel Zaichenkov and Bert Gijsbers and Clemens Grelck and Olga Tveretina and Alex Shafarenko",
year = "2014",
language = "English",
volume = "2015",
booktitle = "Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures",

}

RIS

TY - GEN

T1 - A Case Study in Coordination Programming: S-Net vs Concurrent Collection

AU - Zaichenkov, Pavel

AU - Gijsbers, Bert

AU - Grelck, Clemens

AU - Tveretina, Olga

AU - Shafarenko, Alex

PY - 2014

Y1 - 2014

N2 - We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-NETwith Intel’s Concurrent Collections (CnC). As a coordination language S-NETachieves a near-complete separation of concerns between sequential software components implemented in a separate algorithmic language and their parallel orchestration in an asynchronous data flow streaming network.We investigate the merits of S-NET and CnC with the help of a relevant and non-trivial linear algebra problem: tiled Cholesky decomposition. We describe two alternativeS-NET implementations of tiled Cholesky factorization and compare them with two CnC implementations, one with explicit performance tuning and one without, that have previously been used to illustrate Intel CnC. Our experiments on a 48-coremachine demonstrate that S-NET manages to outperform CnCon this problem.

AB - We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-NETwith Intel’s Concurrent Collections (CnC). As a coordination language S-NETachieves a near-complete separation of concerns between sequential software components implemented in a separate algorithmic language and their parallel orchestration in an asynchronous data flow streaming network.We investigate the merits of S-NET and CnC with the help of a relevant and non-trivial linear algebra problem: tiled Cholesky decomposition. We describe two alternativeS-NET implementations of tiled Cholesky factorization and compare them with two CnC implementations, one with explicit performance tuning and one without, that have previously been used to illustrate Intel CnC. Our experiments on a 48-coremachine demonstrate that S-NET manages to outperform CnCon this problem.

KW - performance measurement; coordination pro- gramming; stream processing; concurrent collections; parallel programming; language design

M3 - Conference contribution

VL - 2015

BT - Proceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures

ER -