Tiling With Limited Resources - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 1997

Tiling With Limited Resources

Résumé

In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. Little work has been devoted to the mapping and scheduling of the tiles on to physical processors. We present several new results in the context of limited computational resources, and assuming communication-computation overlap. In particular, under some reasonable assumptions, we derive the optimal mapping and scheduling of tiles to physical processors

Dates et versions

hal-00856895 , version 1 (02-09-2013)

Identifiants

Citer

Pierre-Yves Calland, Jack Dongarra, Yves Robert. Tiling With Limited Resources. Application Specific Systems, Architectures and Processors, Jul 1997, Zurich, Switzerland. pp.229-238, ⟨10.1109/ASAP.1997.606829⟩. ⟨hal-00856895⟩
98 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More