Show simple item record

dc.contributor.authorPenczek, F.
dc.contributor.authorHerhut, S.
dc.contributor.authorScholz, S.
dc.contributor.authorShafarenko, A.
dc.contributor.authorYang, J.S.
dc.contributor.authorChen, C.-Y.
dc.contributor.authorBagherzadeh, N.
dc.contributor.authorGrelck, C.
dc.date.accessioned2011-01-18T16:06:05Z
dc.date.available2011-01-18T16:06:05Z
dc.date.issued2010
dc.identifier.citationPenczek , F , Herhut , S , Scholz , S , Shafarenko , A , Yang , J S , Chen , C-Y , Bagherzadeh , N & Grelck , C 2010 , Message Driven Programming with S-Net: Methodology and Performance . in In: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), art. no. 5599099 . IEEE , pp. 405-412 . https://doi.org/10.1109/ICPPW.2010.61
dc.identifier.otherPURE: 92479
dc.identifier.otherPURE UUID: 90e39d0d-29e9-40db-9e85-71360b2d945b
dc.identifier.otherdspace: 2299/5165
dc.identifier.otherScopus: 78649830822
dc.identifier.urihttp://hdl.handle.net/2299/5165
dc.descriptionOriginal 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.”
dc.description.abstractDevelopment 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.en
dc.language.isoeng
dc.publisherIEEE
dc.relation.ispartofIn: Proceedings of the International Conference on Parallel Processing Workshops (ICPPW), art. no. 5599099
dc.rightsOpen
dc.titleMessage Driven Programming with S-Net: Methodology and Performanceen
dc.contributor.institutionSchool of Computer Science
dc.relation.schoolSchool of Computer Science
dcterms.dateAccepted2010
rioxxterms.versionofrecordhttps://doi.org/10.1109/ICPPW.2010.61
rioxxterms.typeOther
herts.preservation.rarelyaccessedtrue
herts.rights.accesstypeOpen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record