Show simple item record

dc.contributor.authorGuirado Fernández, Fernando
dc.contributor.authorRipoll, A.
dc.contributor.authorRoig Mateu, Concepció
dc.contributor.authorYuan, X.
dc.contributor.authorLuque, Emilio
dc.date.accessioned2016-07-11T12:51:09Z
dc.date.issued2003
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/10459.1/57431
dc.description.abstractThe detection and exploitation of different kinds of parallelism, task parallelism and data parallelism often leads to efficient parallel programs. This paper presents a simulation environment to predict the best mapping for the execution of message-passing applications on distributed systems. Using this environment, we evaluate the performance of an image processing application for the different parallelizing alternatives, and we propose the ways to improve its performance.ca_ES
dc.description.sponsorshipThis work was supported by the MCyT under contract 2001-2592 and partially sponsored by the Generalitat de Catalunya (G. de Rec. Consolidat 2001SGR-00218).ca_ES
dc.language.isoengca_ES
dc.publisherSpringer Verlagca_ES
dc.relationMICYT/PN2000-2003/TIC2001-2592ca_ES
dc.relation.isformatofReproducció del document publicat a https://doi.org/10.1007/978-3-540-45209-6_33ca_ES
dc.relation.ispartofLecture Notes in Computer Science, 2003, vol. 2790, p. 218-223ca_ES
dc.rights(c) Springer Verlag, 2003ca_ES
dc.titlePredicting the Best Mapping for Efficient Exploitation of Task and Data Parallelismca_ES
dc.typearticleca_ES
dc.identifier.idgrec006893
dc.type.versionpublishedVersionca_ES
dc.rights.accessRightsinfo:eu-repo/semantics/restrictedAccessca_ES
dc.identifier.doihttps://doi.org/10.1007/978-3-540-45209-6_33
dc.date.embargoEndDate2025-01-01


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record