Comparison of PGAS Languages on a Linked Cell Algorithm
| dc.contributor.author | Bauer, Martin | |
| dc.contributor.author | Kuschel, Christian | |
| dc.contributor.author | Ritter, Daniel | |
| dc.contributor.author | Sembritzki, Klaus | |
| dc.date.accessioned | 2017-06-29T21:44:19Z | |
| dc.date.available | 2017-06-29T21:44:19Z | |
| dc.date.issued | 2013 | |
| dc.description.abstract | The intention of partitioned global address space (PGAS) languages is to decrease developing time of parallel programs by abstracting the view on the memory and communication. Despite the abstraction a decent speed-up is promised. In this paper the performance and implementation time of Co-Array Fortran (CAF)Unified Parallel C (UPC) and Cascade High Productivity Language (Chapel) are compared by means of a linked cell algorithm. An MPI parallel reference implementation in C is ported to CAFChapel and UPCrespectivelyand is optimized with respect to the available features of the corresponding language. Our tests show parallel programs are developed faster with the above mentioned PGAS languages as compared to MPI. We experienced a performance penalty for the PGAS versions that can be reduced at the expense of a similar programming effort as for MPI. Programmers should be aware that the utilization of PGAS languages may lead to higher administrative effort for compiling and executing programs on different super-computers. | en |
| dc.identifier.pissn | 0177-0454 | |
| dc.language.iso | en | |
| dc.publisher | Gesellschaft für Informatik e.V., Fachgruppe PARS | |
| dc.relation.ispartof | PARS-Mitteilungen: Vol. 30, Nr. 1 | |
| dc.title | Comparison of PGAS Languages on a Linked Cell Algorithm | en |
| dc.type | Text/Journal Article | |
| gi.citation.publisherPlace | Berlin |
Dateien
Originalbündel
1 - 1 von 1