LACS: a language for affine communication structures

Sanjay Rajopadhye 1
1 API - Parallel VLSI Architectures
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : We propose a language which provides a unified notation for specifying parallel assignment, communication and reduction operations in massively parallel programs. It is designed around a Parallel Assignment Statement (PAS) and Atomic Communication Events (ACE's) and can be used to describe most common communication libraries like 1-to-1 transfer, broadcast, personalized communication, reduce, scans, etc.. as APL-style one-liners. Lacs uses convex polyhedra and affine transformations and hence, tools from linear algebra can be used for compile time analysis. We can automatically detect when a PAS in LACS is well formed, has write conflicts, etc. We can also detect the presence of communication activities like scatters, reduces, scans and their generalizations.
Type de document :
[Research Report] RR-2093, INRIA. 1993
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:50:20
Dernière modification le : vendredi 16 novembre 2018 - 01:29:59
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:11:33



  • HAL Id : inria-00074579, version 1


Sanjay Rajopadhye. LACS: a language for affine communication structures. [Research Report] RR-2093, INRIA. 1993. 〈inria-00074579〉



Consultations de la notice


Téléchargements de fichiers