LACS: a language for affine communication structures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1993

LACS: a language for affine communication structures


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.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2093.pdf (355.51 Ko) Télécharger le fichier

Dates and versions

inria-00074579 , version 1 (24-05-2006)


  • HAL Id : inria-00074579 , version 1


Sanjay Rajopadhye. LACS: a language for affine communication structures. [Research Report] RR-2093, INRIA. 1993. ⟨inria-00074579⟩
60 View
127 Download


Gmail Facebook Twitter LinkedIn More