- A Case Study in Coordination Programming: Performance Evaluation of S-Net vs Intel's Concurrent Collections
- 28th IEEE International Parallel and Distributed Processing Symposium (IPDPS'14), Workshop on Programming Models, Languages and Compilers for Manycore and Heterogeneous Architectures (PLC'14)
- Book/source title
- Proceedings: 2014 IEEE 28th International Parallel and Distributed Processing Symposium Workshops: IPDPSW 2014: 19-23 May 2014, Phoenix, Arizona
- Pages (from-to)
- Los Alamitos, California: IEEE Computer Society
- Document type
- Conference contribution
- Faculty of Science (FNWI)
- Informatics Institute (IVI)
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 CnC on this problem.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.