Show simple item record

dc.contributor.authorAyguadé Parra, Eduard
dc.contributor.authorBlainey, R
dc.contributor.authorDuran González, Alejandro
dc.contributor.authorLabarta Mancho, Jesús José
dc.contributor.authorMartínez, F
dc.contributor.authorMartorell Bofill, Xavier
dc.contributor.authorSilvera, I
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Arquitectura de Computadors
dc.date.accessioned2015-06-26T15:35:33Z
dc.date.created2003-06
dc.date.issued2003-06
dc.identifier.citationAyguade, E. [et al.]. Is the schedule clause really necessary in OpenMP?. "Lecture notes in computer science", Juny 2003, vol. 2716, p. 147-159.
dc.identifier.issn0302-9743
dc.identifier.urihttp://hdl.handle.net/2117/28445
dc.description.abstractChoosing the appropriate assignment of loop iterations to threads is one of the most important decisions that need to be taken when parallelizing Loops, the main source of parallelism in numerical applications. This is not an easy task, even for expert programmers, and it can potentially take a large amount of time. OpenMP offers the schedule clause, with a set of predefined iteration scheduling strategies, to specify how (and when) this assignment of iterations to threads is done. In some cases, the best schedule depends on architectural characteristics of the target architecture, data input, ... making the code less portable. Even worse, the best schedule can change along execution time depending on dynamic changes in the behavior of the loop or changes in the resources available in the system. Also, for certain types of imbalanced loops, the schedulers already proposed in the literature are not able to extract the maximum parallelism because they do not appropriately trade-off load balancing and data locality. This paper proposes a new scheduling strategy, that derives at run time the best scheduling policy for each parallel loop in the program, based on information gathered at runtime by the library itself.
dc.format.extent13 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subjectÀrees temàtiques de la UPC::Informàtica::Arquitectura de computadors::Arquitectures paral·leles
dc.subject.lcshOpenMP
dc.subject.lcshParallel programming (Computer science)
dc.titleIs the schedule clause really necessary in OpenMP?
dc.typeArticle
dc.subject.lemacOpenMP
dc.subject.lemacProgramació en paral·lel (Informàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. CAP - Grup de Computació d'Altes Prestacions
dc.identifier.doi10.1007/3-540-45009-2_12
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://link.springer.com/chapter/10.1007%2F3-540-45009-2_12
dc.rights.accessRestricted access - publisher's policy
drac.iddocument681084
dc.description.versionPostprint (published version)
dc.date.lift10000-01-01
upcommons.citation.authorAyguade, E.; Blainey, R.; Duran, A.; Labarta, J.; Martínez, F.; Martorell, X.; Silvera, I.
upcommons.citation.publishedtrue
upcommons.citation.publicationNameLecture notes in computer science
upcommons.citation.volume2716
upcommons.citation.startingPage147
upcommons.citation.endingPage159


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-NonCommercial-NoDerivs 3.0 Spain