Please use this identifier to cite or link to this item:
Title: Mapping CSP networks to MPI clusters using channel graphs and dynamic instrumentation
Authors: Azzopardi, Gabriella
Vella, Kevin
Muscat, Adrian
Keywords: Computer science
Parallel programming (Computer science)
Issue Date: 2017-08
Publisher: IOS Press
Citation: Azzopardi, G., Vella, K., & Muscat, A. (2017). Mapping CSP networks to MPI clusters using channel graphs and dynamic instrumentation. Communicating Process Architectures 2017, Malta. 109-132.
Abstract: This work investigates a range of techniques for automatically mapping CSP process networks onto an MPI cluster. A CSP library was developed to provide the necessary functionality for implementing CSP-based concurrent applications on top of MPI. The library enables seamless communication between processes on the same node and processes across different nodes. A new configuration language was implemented to provide a straightforward way to map processes onto cluster nodes. This was designed in such a way to allow for mapping the same application using different mapping algorithms without having to recompile the application. The resulting proof-of-concept system was then used to evaluate the suitability of well-known graph partitioning algorithms for distributing a suite of CSP-based applications across a compute cluster, with the aim of reducing application execution time in each case. The experimental results are presented in summary form and briefly analyzed.
Appears in Collections:Scholarly Works - FacICTCS

Files in This Item:
File Description SizeFormat 
2017 - CPA - MPI.pdf
  Restricted Access
447.72 kBAdobe PDFView/Open Request a copy

Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.