Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 3:50:20 PM
Last modification on : Friday, February 4, 2022 - 3:24:32 AM
Long-term archiving on: : Monday, April 5, 2010 - 12:11:33 AM


  • HAL Id : inria-00074579, version 1


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



Record views


Files downloads