Message Driven Programming with S-Net: Methodology and Performance

F. Penczek; S. Herhut; S. Scholz; A. Shafarenko; J.S. Yang; C.-Y. Chen; N. Bagherzadeh; C. Grelck

doi:10.1109/ICPPW.2010.61

Message Driven Programming with S-Net: Methodology and Performance

F. Penczek, S. Herhut, S. Scholz, A. Shafarenko, J.S. Yang, C.-Y. Chen, N. Bagherzadeh, C. Grelck

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Citations (Scopus)

71 Downloads (Pure)

Abstract

Development and implementation of the coordination language S-NET has been reported previously. In this paper we apply the S-NET design methodology to a computer graphics problem. We demonstrate (i) how a complete separation of concerns can be achieved between algorithm engineering and concurrency engineering and (ii) that the S-NET implementation is quite capable of achieving performance that matches what can be achieved using low-level tools such as MPI. We find this remarkable as under S-NET communication, concurrency and synchronization are completely separated from algorithmic code. We argue that our approach delivers a flexible component technology which liberates application developers from the logistics of task and data management while at the same time making it unnecessary for a distributed computing professional to acquire detailed knowledge of the application area.

Original language	English
Title of host publication	In: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), art. no. 5599099
Publisher	IEEE
Pages	405-412
DOIs	https://doi.org/10.1109/ICPPW.2010.61
Publication status	Published - 2010

Access to Document

10.1109/ICPPW.2010.61

905014.pdf

Cite this

@inproceedings{90e39d0d29e940db9e8571360b2d945b,

title = "Message Driven Programming with S-Net: Methodology and Performance",

abstract = "Development and implementation of the coordination language S-NET has been reported previously. In this paper we apply the S-NET design methodology to a computer graphics problem. We demonstrate (i) how a complete separation of concerns can be achieved between algorithm engineering and concurrency engineering and (ii) that the S-NET implementation is quite capable of achieving performance that matches what can be achieved using low-level tools such as MPI. We find this remarkable as under S-NET communication, concurrency and synchronization are completely separated from algorithmic code. We argue that our approach delivers a flexible component technology which liberates application developers from the logistics of task and data management while at the same time making it unnecessary for a distributed computing professional to acquire detailed knowledge of the application area.",

author = "F. Penczek and S. Herhut and S. Scholz and A. Shafarenko and J.S. Yang and C.-Y. Chen and N. Bagherzadeh and C. Grelck",

note = "Original article can be found at: http://ieeexplore.ieee.org “This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.{"} “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.”",

year = "2010",

doi = "10.1109/ICPPW.2010.61",

language = "English",

pages = "405--412",

booktitle = "In: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), art. no. 5599099",

publisher = "IEEE",

}

TY - GEN

T1 - Message Driven Programming with S-Net: Methodology and Performance

AU - Penczek, F.

AU - Herhut, S.

AU - Scholz, S.

AU - Shafarenko, A.

AU - Yang, J.S.

AU - Chen, C.-Y.

AU - Bagherzadeh, N.

AU - Grelck, C.

N1 - Original article can be found at: http://ieeexplore.ieee.org “This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder." “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.”

PY - 2010

Y1 - 2010

N2 - Development and implementation of the coordination language S-NET has been reported previously. In this paper we apply the S-NET design methodology to a computer graphics problem. We demonstrate (i) how a complete separation of concerns can be achieved between algorithm engineering and concurrency engineering and (ii) that the S-NET implementation is quite capable of achieving performance that matches what can be achieved using low-level tools such as MPI. We find this remarkable as under S-NET communication, concurrency and synchronization are completely separated from algorithmic code. We argue that our approach delivers a flexible component technology which liberates application developers from the logistics of task and data management while at the same time making it unnecessary for a distributed computing professional to acquire detailed knowledge of the application area.

AB - Development and implementation of the coordination language S-NET has been reported previously. In this paper we apply the S-NET design methodology to a computer graphics problem. We demonstrate (i) how a complete separation of concerns can be achieved between algorithm engineering and concurrency engineering and (ii) that the S-NET implementation is quite capable of achieving performance that matches what can be achieved using low-level tools such as MPI. We find this remarkable as under S-NET communication, concurrency and synchronization are completely separated from algorithmic code. We argue that our approach delivers a flexible component technology which liberates application developers from the logistics of task and data management while at the same time making it unnecessary for a distributed computing professional to acquire detailed knowledge of the application area.

U2 - 10.1109/ICPPW.2010.61

DO - 10.1109/ICPPW.2010.61

M3 - Conference contribution

SP - 405

EP - 412

BT - In: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), art. no. 5599099

PB - IEEE

ER -

Message Driven Programming with S-Net: Methodology and Performance

Abstract

Access to Document

Fingerprint

Cite this