Message Driven Programming with S-Net: Methodology and Performance

Abstract

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.???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

Distributed S-Net: Cluster and Grid Computing without the Hassle

“…Fortunately, the high-level message passing approach of Distributed S-NET makes it fairly easy to extend the static mapping towards a dynamic, availabilitydriven mapping of M chunks to N compute nodes with M > N; the complete solution is shown in Fig. 10 We employ both domain decomposition patterns (static and dynamic) to implement a distributed ray tracer [9]. Experiments compare both S-NET solutions with a C implementation that is manually parallelized using MPI; Fig.…”

Type-Driven Automated Program Transformations and Cost Modelling for Optimising Streaming Programs on FPGAs

“…It is in fact a subset of Haskell, except for the use of dependent vector types. Furthermore, as it is a coordination language-in the sense of S-Net [24]-, functions and input vectors only have a type declaration but no implementation.…”