Premium
Space–time mapping and tiling: a helpful combination
Author(s) -
Griebl Martin,
Faber Peter,
Lengauer Christian
Publication year - 2004
Publication title -
concurrency and computation: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.309
H-Index - 67
eISSN - 1532-0634
pISSN - 1532-0626
DOI - 10.1002/cpe.772
Subject(s) - computer science , loop tiling , parallel computing , compiler , execution time , context (archaeology) , spacetime , simple (philosophy) , automatic parallelization , algorithm , theoretical computer science , programming language , paleontology , philosophy , physics , epistemology , quantum mechanics , biology
Tiling is a well‐known technique for sequential compiler optimization, as well as for automatic program parallelization. However, in the context of parallelization, tiling should not be considered as a stand‐alone technique, but should be applied after a dedicated parallelization phase, in our case after space–time mapping . We show how tiling can benefit from space–time mapping, and we derive an algorithm for computing tiles which can minimize the number of communication startups, taking the number of physically available processors into account. We also present how the use of a simple cost model reduces real execution time. Copyright © 2004 John Wiley & Sons, Ltd.