Efficient Mapping for Message-Passing Applications Using the TTIG Model: A Case Study in Image Processing
dc.contributor.author | Roig Mateu, Concepció | |
dc.contributor.author | Ripoll, A. | |
dc.contributor.author | Borrás, Javier | |
dc.contributor.author | Luque, Emilio | |
dc.date.accessioned | 2016-06-23T08:01:46Z | |
dc.date.issued | 2001 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.uri | http://hdl.handle.net/10459.1/57270 | |
dc.description.abstract | In this paper we describe the development and performance of an image processing application with functional parallelism within the PVM framework. The temporal behaviour of the application is statically modelled with the new task graph model TTIG (Temporal Task Interaction Graph), that enhances classical models by capturing percentages of concurrency between adjacent tasks. We show how this information can be used in the mapping phase in order to obtain better assignments of tasks to processors. The effectiveness of the TTIG in allocation for the application under study is established through experimentation on a cluster of PCs. | ca_ES |
dc.description.sponsorship | This work was supported by the CICYT under contract TIC98-043 | ca_ES |
dc.language.iso | eng | ca_ES |
dc.publisher | Springer Verlag | ca_ES |
dc.relation.isformatof | Reproducció del document publicat a https://doi.org/10.1007/3-540-45417-9_50 | ca_ES |
dc.relation.ispartof | Lecture Notes in Computer Science, 2001, vol. 2131, p. 370-377 | ca_ES |
dc.rights | (c) Springer Verlag, 2001 | ca_ES |
dc.title | Efficient Mapping for Message-Passing Applications Using the TTIG Model: A Case Study in Image Processing | ca_ES |
dc.type | article | ca_ES |
dc.identifier.idgrec | 008087 | |
dc.type.version | publishedVersion | ca_ES |
dc.rights.accessRights | info:eu-repo/semantics/restrictedAccess | ca_ES |
dc.identifier.doi | https://doi.org/10.1007/3-540-45417-9_50 | |
dc.date.embargoEndDate | 2025-01-01 |