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

Documents

View graph of relations
Original languageEnglish
Title of host publicationProceedings of Programming Models, Languages and Compilers Workshop for Manycore and Heterogeneous Architectures
Number of pages1
Volume2015
Publication statusPublished - 2014
EventWorkshop on Programming Models, Languages and Compilers for Manycore and Heterogeneous Architectures (PLC'14) - Phoenix, United States
Duration: 19 May 2014 → …

Workshop

WorkshopWorkshop on Programming Models, Languages and Compilers for Manycore and Heterogeneous Architectures (PLC'14)
CountryUnited States
CityPhoenix
Period19/05/14 → …

Abstract

We present a programming methodology and runtime performance case study comparing the declarative data flow coordination language S-NET
with Intel’s Concurrent Collections (CnC). As a coordination language S-NET
achieves 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 alternative
S-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-core
machine demonstrate that S-NET manages to outperform CnCon this problem.

ID: 9998254