Show simple item record

dc.contributor.authorRoig Mateu, Concepció
dc.contributor.authorRipoll, A.
dc.contributor.authorBorrás, Javier
dc.contributor.authorLuque, Emilio
dc.date.accessioned2016-06-23T08:01:46Z
dc.date.issued2001
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10459.1/57270
dc.description.abstractIn 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.sponsorshipThis work was supported by the CICYT under contract TIC98-043ca_ES
dc.language.isoengca_ES
dc.publisherSpringer Verlagca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1007/3-540-45417-9_50ca_ES
dc.relation.ispartofLecture Notes in Computer Science, 2001, vol. 2131, p. 370-377ca_ES
dc.rights(c) Springer Verlag, 2001ca_ES
dc.titleEfficient Mapping for Message-Passing Applications Using the TTIG Model: A Case Study in Image Processingca_ES
dc.typearticleca_ES
dc.identifier.idgrec008087
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1007/3-540-45417-9_50
dc.date.embargoEndDate2025-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record