HEAL DSpace

Coarse-grain parallel execution for 2-dimensional PDE problems

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Goumas, G en
dc.contributor.author Drosinos, N en
dc.contributor.author Karakasis, V en
dc.contributor.author Koziris, N en
dc.date.accessioned 2014-03-01T02:44:31Z
dc.date.available 2014-03-01T02:44:31Z
dc.date.issued 2007 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/31858
dc.subject Coarse Grained en
dc.subject Data Dependence en
dc.subject Program Development en
dc.subject 2 dimensional en
dc.subject.other Algorithms en
dc.subject.other Finite difference method en
dc.subject.other Mathematical transformations en
dc.subject.other Problem solving en
dc.subject.other Coarse grain execution en
dc.subject.other Cyclic mapping en
dc.subject.other Parallel SPMD codes en
dc.subject.other Tiling transformations en
dc.subject.other Parallel processing systems en
dc.title Coarse-grain parallel execution for 2-dimensional PDE problems en
heal.type conferenceItem en
heal.identifier.primary 10.1109/IPDPS.2007.370571 en
heal.identifier.secondary http://dx.doi.org/10.1109/IPDPS.2007.370571 en
heal.identifier.secondary 4228299 en
heal.publicationDate 2007 en
heal.abstract This paper presents a new approach for the execution of coarse-grain (tiled) parallel SPMD code for applications derived from the explicit discretization of 2-dimensional PDE problems with finite-differencing schemes. Tiling transformation is an efficient loop transformation to achieve coarse-grain parallelism in such algorithms, while rectangular tile shapes are the only feasible shapes that can be manually applied by program developers. However, rectangular tiling transformations are not always valid due to data dependencies, and thus requiring the application of an appropriate skewing transformation prior to tiling in order to enable rectangular tile shapes. We employ cyclic mapping of tiles to processes and propose a method to determine an efficient rectangular tiling transformation for a fixed number of processes for 2-dimensional, skewed PDE problems. Our experimental results confirm the merit of coarse-grain execution in this family of applications and indicate that the proposed method leads to the selection of highly efficient tiling transformations. © 2007 IEEE. en
heal.journalName Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM en
dc.identifier.doi 10.1109/IPDPS.2007.370571 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής