LIP Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Michel Cosnard, Adresses Lectroniques
Unit de recherche associe au CNRS n1398 On NC-real complexity classes for additive circuits and their relations with NC
The Data-Parallel Programming Model: a Semantic Perspective (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques
We propose a short introduction to the Data-Parallel programming model. We show that parallel computing often makes little distinction between the execution model and the programming model. This...
LIP Laboratoire de l'Informatique du (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Jean-luc Levaire, Jean-luc Levaire
Unit de recherche associe au CNRS n1398 Control structures for data-parallel SIMD languages: semantics and implementation
Inversion of 2D cellular automata: some complexity results (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Bruno Durand, Bruno Durand
Unit de recherche associe au CNRS n1398
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Christine Paulin-mohring
In the pure Calculus of Constructions, it is possible to represent data structures and predicates using higher-order quantification. However, this representation is not satisfactory, from the point...
One-way Cellular Automata on Cayley Graphs (2007)
Ecole Normale, Suprieure Lyon, Zsuzsanna R'oka Mars, Adresses Lectroniques
The notion of one-dimensional one-way cellular automata has been introduced to model cellular automata with only a oneway communication between two neighbor cells. In this paper, we generalize this...
LIP Laboratoire de l'Informatique du (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Afonso Ferreira, Afonso Ferreira
Unit de recherche associe au CNRS n1398 Ultra-fast parallel contour tracking, with applications to thinning
Construction of DO Loops from Systems of Affine Constraints (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Jean-francois Collard, Jean-francois Collard, Paul Feautrier, ...
Most parallelization techniques for DO loop nests are based on reindexation. Reindexation yields a new iteration space, which is a convex integer polyhedron defined by a set of affine constraints....
Dictionary Machine on SIMD Architectures (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Michel Gastaldo, Michel Gastaldo
This paper presents an implementation of a dictionary machine on a SIMD architecture. The goal of this study is to propose a practical implementation with good performances, taking into account the...
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Arnulfo Azcarraga, Arnulfo Azcarraga, Didier Puzenat, ...
Unit de recherche associe au CNRS n1398 An incremental neural classifier on a MIMD computer
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, C. Parent
Unit de recherche associe au CNRS n1398 Developing certified programs in the system Coq
SCHEDULING A SCATTERING-GATHERING SEQUENCE ON HYPERCUBES (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Henri-pierre Charles, Henri-pierre Charles, Pierre Fraigniaud, ...
The scattering problem refers to the gossiping and the broadcasting problems [1,2]. It consists in distributing a set of data from a single source such that each component is destinated to a distinct...
LIP Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Afonso Ferreira, Afonso Ferreira, ...
Unit de recherche associe au CNRS n1398 Towards simple massively parallel systems: Bus based parallel computers and new communication patterns
LIP Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Pascal Koiran, Adresses Lectroniques
Unit de recherche associe au CNRS n1398 On the relations between dynamical systems and boolean circuits
: An extension of the Calculus of Constructions with fixpoints (2007)
: An extension of the
A Proof System for a Simple Data-Parallel Programming Language (1993)
Luc Bouge, Ecole Normale, Suprieure Lyon, Adresses Lectroniques, Yann Le Guyadec, Yann Le Guyadec, ...
We describe a small kernel language which encapsulates the semantic features of data-parallel control constructs as found in modern data-parallel languages. We give it a denotational semantics, and...