An adaptive strategy for deflection routing in meshes (2007)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Thierry Chich
Unit de recherche associe au CNRS n1398 An adaptive strategy for deflection routing in meshes
A module calculus enjoying the subject-reduction property Preliminary version (2007)
Ecole Normale, Suprieure Lyon, Judicael Courant October, Judicael Courant
Unit de recherche associe au CNRS n1398 A module calculus enjoying the subject-reduction property
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
and some Elementary Functions using Small Multipliers (2007)
Ecole Normale, Suprieure Lyon, Milos D. Ercegovac, Milos D. Ercegovac, Tomas Lang, Tomas Lang, ...
This paper deals with the computation of reciprocals, square roots, inverse square roots, and some elementary functions using small tables, small multipliers, and for some functions, a final...
Ecole Normale, Suprieure Lyon, B. Girau, B. Girau, B. Girau, A. Tisserand, ...
Unit de recherche associe au CNRS n1398
Broadcasting and Multicasting by Shortest Path in Cut-through Routed Networks (2007)
Ecole Normale, Suprieure Lyon, Johanne Cohen, Johanne Cohen, Pierre Fraigniaud, Pierre Fraigniaud, ...
n1398
A decision procedure for Direct Predicate Calculus Study and implementation in the system Coq (2007)
Ecole Normale, Suprieure Lyon, Jean-christophe Filli
Unit de recherche associe au CNRS n1398 A decision procedure for Direct
Scheduling using mixed arithmetic: an ILP formulation (2007)
Olivier Peyran November, Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Anne Mignotte, ...
Unit de recherche associe au CNRS n1398 Scheduling using mixed arithmetic: an ILP formulation
Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Serge Miguet, Serge Miguet, Jean-marc Pierson, Jean-marc Pierson
Unit de recherche associe au CNRS n1398 Dynamic load balancing in a parallel particle simulation
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...
Massivelly parallel machine based on T9000 and C104 (2007)
Ecole Normale, Suprieure Lyon, Eric Fleury, Eric Fleury, Marc Picquendar, Marc Picquendar, ...
Unit de recherche associe au CNRS n1398 Massivelly parallel machine based on
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...
Ecole Normale, Suprieure Lyon, Bernard Girau, Bernard Girau
A parallel back-propagation algorithm that partitions the training set has been introduced in [6]. Its performance on MIMD machines is studied, and a new version is developped. It is based on a...
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
Laboratoire de l'Informatique du (2007)
Ecole Normale, Suprieure Lyon, Virginie Marion-poty, Serge Miguet, Serge Miguet
Unit de recherche associe au CNRS n1398 A new 2-D and 3-D thinning algorithm based on successive border generations
Is it possible to discriminate odors with common words? (2007)
Ecole Normale, Suprieure Lyon, Regina Eberhardt, Regina Eberhardt, Didier Puzenat, Didier Puzenat, ...
Unit de recherche associe au CNRS n1398 Is it possible to discriminate odors with common words?
Laboratoire de l'Informatique du (2007)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon
Unit de recherche associe au CNRS n1398 Programmation fonctionnelle et parall'elisme: une approche pragmatique Ga'etan Hains
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....
Explicit Substitutions for the Lambda-Mu Calculus (2007)
We present a confluent rewrite system which extents a previous calculus of explicit substitutions for the lambda-calculus [HaLe89] to Parigot's untyped lambda-mu-calculus [Par91]. This extension...
Automatic Definition of Sub neural networks (2007)
Unit de recherche associe au CNRS n1398
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...
Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Bruno Durand, Bruno Durand
Unit de recherche associe au CNRS n1398 On the complexity of deadlock detection in families of planar nets
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
Synthesizing proofs from programs in the Calculus of Inductive Constructions (2007)
Ecole Normale, Suprieure Lyon, Catherine Parent December, Catherine Parent
Unit de recherche associe au CNRS n1398
Ecole Normale, Suprieure Lyon, Adresses Lectroniques, C. Parent
Unit de recherche associe au CNRS n1398 Developing certified programs in the system Coq
A logical framework to prove properties of Alpha programs (revised version) (2007)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, David Cachera
Unit de recherche associe au CNRS n1398 A logical framework to prove properties of Alpha programs (revised version)
Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale, Suprieure Lyon, Olivier Bournez, Olivier Bournez, Michel Cosnard, Michel Cosnard
Unit de recherche associe au CNRS n1398 On the computational power and super-Turing capabilities of dynamical systems
Laboratoire de l'Informatique du (2007)
Ecole Normale, Suprieure Lyon, Lionel Brunie, Lionel Brunie, Harald Kosch, Harald Kosch
Unit de recherche associe au CNRS n1398 A communication-oriented approach to parallel relational query optimization and processing
Length and Number of Buses for Gossiping in Networks (2007)
Ecole Normale, Suprieure Lyon, Pierre Fraigniaud, Pierre Fraigniaud, Christian Laforest, Christian Laforest
Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all the other nodes. A bus network is a...
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
Factoring and scaling Kautz digraphs (2007)
Scaling Kautz Digraphs, Ecole Normale, Suprieure Lyon
Unit de recherche associe au CNRS n1398
self-balancing distributed search trees (2007)
Ecole Normale, Suprieure Lyon, Xavier Messeguer, Xavier Messeguer
Unit de recherche associe au CNRS n1398 Concurrent AVL revisited: self-balancing distributed search trees
Laboratoire de l'Informatique du Paralllisme (2007)
Ecole Normale Suprieure, Suprieure Lyon, Yann Le Guyadec, Yann Le Guyadec, Gil Utard, Gil Utard, ...
We present a weakest preconditions calculus `a la Dijkstra for a small common kernel of existing data-parallel languages. We use two-part assertions, where the current extent of parallelism is...
Laboratoire de l'Informatique du (2007)
Ecole Normale, Suprieure Lyon, Alain Darte Septembre, Alain Darte
Unit de recherche associe au CNRS n1398 Mathematical tools for loop transformations: from systems of uniform recurrence equations to the polytope model
Laboratoire de l'Informatique du (2007)
Unit de recherche associe au CNRS n1398 Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs Alain Darte and Fr'ed'eric Vivien
Optimal Deadlock-free Path-based Multicast Algorithms in Meshes (2007)
Ecole Normale, Suprieure Lyon, Vincent Bouchitt E, Vincent Bouchitt E, Johanne Cohen, Eric Fleury, ...
Multicasting is an information dissemination problem which consists, for a node of a distributed memory parallel computer, of sending the same message to an arbitrary subset of nodes. The two major...
Deriving Proof Rules from Continuation Semantics (2007)
Ecole Normale, Suprieure Lyon, Elena Zucca, Elena Zucca
We claim that the continuation style semantics of a programming language can provide a starting point for constructing a proof system for that language. The basic idea is to see weakest precondition...
Co-Inductive Types in Coq: An Experiment with the Alternating Bit Protocol (2007)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon
We describe an experience concerning the implementation and use of co-inductive types in the proof editor Coq. Co-inductive types are recursive types which, opposite to inductive ones, may be...
Elimination of Parameters in the Polynomial Hierarchy (1998)
Ecole Normale, Suprieure Lyon, Pascal Koiran, Pascal Koiran, Pascal Koiran
Blum, Cucker, Shub and Smale have shown that the problem "P = NP ?" has the same answer in all algebraically closed fields of characteristic 0. We generalize this result to the polynomial...
Algebraic Tools for the Construction of Colored Flows With Constraints (1998)
Ecole Normale, Eric Rémila, Suprieure Lyon, Marius Dorkenoo, Marius Dorkenoo, ...
We give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting...
The Game of Life: universality revisited (1998)
Zs. R'oka January, Zs. Roka, Ecole Normale, Suprieure Lyon, B. Durand, B. Dur
The Game of Life was created by J.H. Conway. One of the main features of this game is its universality. We prove in this paper this universality with respect to several computational models: boolean...
Task Ordering in Linear Tiles (1998)
Ecole Normale, Suprieure Lyon, Fabrice Rastello, Fabrice Rastello, Amit Rao, Amit Rao, ...
In this report we address the issue of loop tiling to minimize the completion time of the loop when executed on multicomputers. We remove the restriction of atomicity of tiles and internal...
JNN, a Randomized Algorithm for Learning Multilayer Networks in Polynomial Time (1998)
André Elisseeff, Hélène Paugam-Moisy, Ecole Normale, Suprieure Lyon
From an analytical approach of the multilayer architecture, we deduce a polynomialtime algorithm for learning from examples. We call it JNN, for "Jacobian Neural Network". Although this...
Do Most Strong Definitions of Randomness Exist? (1998)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Bruno Durand, Bruno Durand, ...
The goal of our paper is to propose a way to obtain more refined definitions of randomness than the notions known so far (e.g. MartinL of randomness). We show that a "perfect" definition of...
Tiling for Heterogeneous Computing Platforms (1998)
Ecole Normale, Suprieure Lyon, Pierre Boulet, Frédéric Vivien, Pierre Boulet, Jack Dongarra, ...
In the framework of fully permutable loops, tiling has been extensively studied as a source-to-source program transformation. However, little work has been devoted to the mapping and scheduling of...
On connectedness and dimension of a Besicovitch space over S Z (1998)
P. Kurka Janvier, Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, E. Formenti, ...
We prove that the topological space S Z = : = , proposed in [5] is path-connected and has infinite dimension. The latter property makes of this space a more natural setting for cellular automata when...
Concurrent rebalancing of AVL trees: A fine-grained approach (1997)
Luc Bouge, Joaquim Gabarró, Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, ...
We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a relabalancing may for instance be necessary after successive insertions and deletions of keys. We show...
Detecting and Removing Dead Code using Rank 2 Intersection (1997)
Ecole Normale, Frédéric Prost, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Ferrrucio Damiani, ...
In this paper we extend, by allowing rank 2 intersection types, the type assignment system for the detection and elimination of dead code in typed functional programs presented by Coppo et al...
Protocol design for high performance networking: a Myrinet experience (1997)
Ecole Normale, Suprieure Lyon, Loic Prylli, Loic Prylli, Bernard Tourancheau, Bernard Tourancheau
High speed networks are now providing incredible performance. Software evolution is slow and the old protocol stacks are no longer adequate for these kind of communication speeds. When bandwidth...
Stéphane Ubéda, Janez Zerovnik, Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon
We study a problem coming from the design of wireless cellular radiocommunication network. Frequency planning constraints are modelled in terms of graph theory. For each planning function f let us...
Fast Evaluation of Functions at Regularly-Spaced Points (1997)
Ecole Normale, Suprieure Lyon, Milos D. Ercegovac, Milos D. Ercegovac, Jean-Michel Muller
We present a method, called the value- preserving (VP) method for reducing the amount of work when computing the value of a function at regularly spaced points. Th VP method uses the fact that if two...
Are Lower Bounds Easier over the Reals? (1997)
Herve Fournier, Pascal Koiran October, Ecole Normale, Suprieure Lyon, Pascal Koiran, Pascal Koiran
We show that proving lower bounds in algebraic models of computation may not be easier than in the standard Turing machine model. For instance, a superpolynomial lower bound on the size of an...
Undecidability of the Global Fixed Point Attractor Problem on Circular Cellular Automata (1997)
Ecole Normale, Suprieure Lyon, Jacques Mazoyer, Jacques Mazoyer, Ivan Rapaport, Ivan Rapaport
A great amount of work has been devoted to the understanding of the longtime behavior of cellular automata (CA). As for any other kind of dynamical system, the long-time behavior of a CA is described...
An Algorithm that Computes a Lower Bound on the Distance Between a Segment and Z² (1997)
Vincent Lefevre, Ecole Normale, Suprieure Lyon
We give a fast algorithm for computing a lower bound on the distance between a straight line and the points of a regular grid. This algorithm is used to find worst cases when trying to round the...
A shift-invariant metric on S Z inducing a non-trivial topology (1997)
Margara J. Mazoyer, Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, G. Cattaneo, ...
In this paper we discuss the meaning of sensitivity and its implications in CA behavior. A new shift-invariant metric is given. The metric topology induced by this metric is perfect but not compact....
Proof of Imperative Programs in Type Theory (1997)
Ecole Normale, Suprieure Lyon, Jean-Christophe Filliâtre, Jean-christophe Filliatre
Proofs of correctness of imperative programs are traditionally done in first order frameworks derived from Hoare logic [8]. On the other hand, correctness proofs of purely functional programs are...
Some bounds on the computational power of Piecewise Constant Derivative systems. (1997)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Olivier Bournez, Olivier Bournez
We study the computational power of Piecewise Constant Derivative (PCD) systems. PCD systems are dynamical systems defined by a piecewise constant differential equation and can be considered as...
Determining the Idle Time of a Tiling: New Results (1997)
Frédéric Desprez, Ecole Normale, Suprieure Lyon, Jack Dongarra, Jack Dongarra, Fabrice Rastello, ...
In the framework of fully permutable loops, tiling has been studied extensively as a sourceto -source program transformation. We build upon recent results by Hogsted, Carter, and Ferrante [12], who...
Recoders for Partial Compression and Rounding (1997)
Ecole Normale, Suprieure Lyon, M. Daumas, M. Daumas, D. Matula, D. Matula
The purpose of this paper is to treat digit set conversions and digit recodings in terms of primitive recoding operations that have elementary implementations. The partial compressions and roundings...
Elimination of Parameters in the Polynomial Hierarchy (1997)
Pascal Koiran Octobre, Ecole Normale, Suprieure Lyon, Pascal Koiran, Pascal Koiran
Blum, Cucker, Shub and Smale have shown that the "P = NP ?" problem has the same answer in all algebraically closed fields of characteristic 0. We generalize this result to the polynomial...
Finite Automata Theory in Coq - A constructive proof of Kleene's theorem (1997)
Ecole Normale, Suprieure Lyon, Jean-Christophe Filliâtre
We describe here a development in the system Coq of a piece of Finite Automata Theory. The main result is the Kleene's theorem, expressing that regular expressions and finite automata define the...
Inducing an Order on Cellular Automata by a Grouping Operation (1997)
Ecole Normale, Suprieure Lyon, Jacques Mazoyer, Jacques Mazoyer, Ivan Rapaport, Ivan Rapaport
A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the...
A Model for Using Redundant Number Systems in Special-Purpose Architectures (1997)
Jean Michel, Olivier Peyran, Ecole Normale, Suprieure Lyon, Anne Mignotte, Anne Mignotte, ...
Our goal is to design tools for high-level synthesis of special-purpose arithmetic circuits. After a presentation of what we call "mixed arithmetics" (that is, the use of different number...
An Extended Comparison of Slotted and Unslotted Deflection Routing (1997)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Thierry Chich, Thierry Chich, ...
In this paper, we have experimentally compared synchronized versus asynchronized all-optical deflection networks. The originality of our approach is first that we have included a model of bursty...
Exploiting Data Structures in a High Performance Video Server for TV archives. (1997)
Ecole Normale, Suprieure Lyon, Ahmed Mostefaoui, Ahmed Mostefaoui, Lionel Brunie, Lionel Brunie
One of the key components in a multimedia interactive system is the continuous media server which is mainly dedicated to support the storage, retrieval and delivery of video streams. In this context,...
ML Type Inference for Dead Code Analysis (1997)
Frédéric Prost, Ecole Normale, Suprieure Lyon
We propose to adapt ML type inference algorithm to find and erase dead-code in simply typed -terms. We prove the correctness of our optimization: the optimized program is observationally equivalent...
Asynchronous Sub-Logarithmic Adders (1997)
Ecole Normale, Suprieure Lyon, J.M. Muller, J. M. Muller, A. Tisserand, A. Tisser, ...
Fast arithmetic operators have always been an important topic in computer design. There are two kinds of arithmetic operators: fixed-time and variable-time ones. While fixed-time arithmetic operators...
Kolmogorov Complexity and Cellular Automata Classification (1997)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, ...
We present a new approach to cellular automata (CA for short) classification based on algorithmic complexity. We construct a parameter which is based only on the transition table of CA and measures...
Mixed Arithmetics: Introduction and Design Structure (1997)
Ecole Normale, Suprieure Lyon, Anne Mignotte, Jean Michel, Muller Olivier Peyran
CAD tools for special purpose architecture usually use conventional radix 2 number system to represent integers. However, DSP designer expertise shows that redundant number systems improve the delay...
Experiments with a Randomized Algorithm for a Frequency Assignment Problem (1997)
Janez Zerovnik, Ecole Normale, Suprieure Lyon
The problems of assigning frequencies to transmitters can be naturally modelled by generalizations of graph coloring problems. We start with a randomized graph coloring algorithm of Petford and Welsh...
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy (1997)
Ecole Normale, Suprieure Lyon, Olivier Bournez
We pursue the study of the computational power of Piecewise Constant Derivative (PCD) systems started in [5, 6]. PCD systems are dynamical systems defined by a piecewise constant differential...
Laboratoire de l'Informatique du (1996)
Unit de recherche associe au CNRS n1398 On the optimality of Allen and Kennedy's algorithm for parallelism extraction in nested loops Alain Darte and Fr'ed'eric Vivien
Combining Retiming and Scheduling Techniques for Loop Parallelization and Loop Tiling (1996)
Ecole Normale, Georges-André Silber, Frédéric Vivien, Suprieure Lyon, Alain Darte, Alain Darte
Tiling is a technique used for exploiting medium-grain parallelism in nested loops. It relies on a first step that detects sets of permutable nested loops. All algorithms developed so far consider...
Self-Applicable Partial Evaluation for Pi-Calculus (1996)
Ecole Normale, Suprieure Lyon, Marc Gengler, Marc Gengler, Matthieu Martel, Matthieu Martel
In this paper we are interested in self-applicable partial evaluation for picalculus, a language that models concurrent behavior of parallel systems. We use the usual three-step methodology: First,...
Topologically Defined Isosurfaces (1996)
Topologically Defined Isosurfaces, Ecole Normale, Suprieure Lyon, Jacques-olivier Lachaud
In this research report, we present a new process for defining and building the set of configurations of Marching-Cubes algorithms. Our aim is to extract a topologically correct isosurface from a...
Simple Sequences Strain Error Analysis (1996)
Ecole Normale, Suprieure Lyon, Marc Daumas, Marc Daumas
Past studies on floating point arithmetic have presented unexpected behaviors of some compound floating point operations. All the simple examples share the same all or nothing option: they either...
On the Removal of Anti and Output Dependences (1996)
Ecole Normale, Suprieure Lyon, Pierre-yves Calland, Frédéric Vivien, Pierre-yves Calland, Alain Darte, ...
In this paper we build upon results of Padua and Wolfe [8], who introduce two graph transformations to eliminate anti and output dependences. We first give a unified framework for such...
d-Dimensional Range Search on Multicomputers (1996)
Ecole Normale, Ecole Normale, Suprieure Lyon, Stéphane Ubéda, Suprieure Lyon, Afonso Ferreira, ...
Given a set L of n points in the d-dimensional Cartesian space E d , and a query specifying a domain q in E d , the Range Search problem consists in identifying the subset R(q) of the points of L...
Plugging Anti and Output Dependence Removal Techniques Into Loop Parallelization Algorithms (1996)
Ecole Normale, Suprieure Lyon, Pierre-yves Calland, Pierre-yves Calland, Alain Darte, Alain Darte, ...
In this paper we shortly survey some loop transformation techniques which break anti or output dependences, or artificial cycles involving such "false" dependences. These false dependences...
Lower Bounds for Shortest Path Interval Routing (1996)
Ecole Normale, Stephane Perennes, Suprieure Lyon, Cyril Gavoille, Cyril Gavoille
Interval Routing was introduced to reduce the size of the routing tables: a router finds the direction to forward a message by determining the interval that contains the destination address of the...
Ecole Normale, Suprieure Lyon, Lionel Brunie, Lionel Brunie, Harald Kosch, Harald Kosch
This report presents a novel representation model of parallel relational query execution plans, called DPL graphs. This model allows to deal with any kind of parallel architecture and any kind of...
The Real Dimension Problem is NP R -Complete (1996)
Pascal Koiran Octobre, Ecole Normale, Suprieure Lyon, Pascal Koiran, Pascal Koiran
We show that computing the dimension of a semi-algebraic set of R n is a NPR -complete problem in the Blum-Shub-Smale model of computation over the reals. Since this problem is easily seen to be NPR...
Laboratoire de l'Informatique du Paralllisme (1996)
Ecole Normale Suprieure, Suprieure Lyon, T. Br, T. Br, S. Chaumette, S. Chaumette, ...
In this report, we present the HPFIT project whose aim is to provide a set of interactive tools integrated in a single environment to help users to parallelize scientific applications to be run on...
A note on the XRAM and PRAM models (1996)
Pierre Fraigniaud, Ecole Normale, Suprieure Lyon
In this paper, we deal with the XRAM model introduced in [3]. We mainly show that the original definition of the XRAM model was not consistent, and must be slightly modified. Therefore, we modify the...
A logical framework to prove properties of ALPHA programs (1996)
Luc Bouge, Ecole Normale, Suprieure Lyon, David Cachera
We present an assertional approach to prove properties of Alpha programs. Alpha is a functional language based on affine recurrence equations. We first present two kinds of operational semantics for...
Comparative Study of Three Connectionist Models on a Classification Problem (1996)
R. Baron, M.B. Gordon, H. Paugam-Moisy, Ecole Normale, Suprieure Lyon
In this paper, we compare three neural learning models, on the sonar target classification problem of Gorman and Sejnowski, in two ways. First, we compare the performance on training and testing...
Multilayer Neural Networks: One Or Two Hidden Layers ? (1996)
Ecole Normale, Ecole Normale, Suprieure Lyon, Suprieure Lyon, Graham Brightwell Claire, Graham Brightwell, ...
We study the number of hidden layers required by a multilayer neural network with threshold units to compute a function f from R d to f0; 1g. In spite of similarity with the characterization of...
A New Guaranteed Heuristic for the Software Pipelining Problem (1995)
Ecole Normale, Suprieure Lyon, Pierre-yves Calland, Pierre-yves Calland, Alain Darte, Alain Darte, ...
We present yet another heuristic for the software pipelining problem. We believe this heuristic to be of interest because it brings a new insight to the software pipelining problem by establishing...
The Bouclettes loop parallelizer (1995)
Ecole Normale, Suprieure Lyon, Pierre Boulet
Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output an HPF (High Performance Fortran) program with data distribution...
Code generation in Bouclettes (1995)
Ecole Normale, Michèle Dion, Suprieure Lyon, Pierre Boulet, Pierre Boulet
Bouclettes is a source to source loop nest parallelizer. It takes as input Fortran uniform, perfectly nested loops and gives as output a HPF (High Performance Fortran) program with data distribution...
Fuzzy array dataflow analysis (1994)
Ecole Normale, Suprieure Lyon, Jean-francois Collard, Jean-francois Collard, Paul Feautrier, Paul Feautrier, ...
Exact array dataflow analysis can be achieved in the general case if the only control structures are the sequence, the do-loop and restricted ifs, and if loop counter bounds and array subscripts are...
Automatic Parallelization Based on Multi-Dimensional Scheduling (1994)
Ecole Normale, Frédéric Vivien, Suprieure Lyon, Alain Darte, Alain Darte
In the scope of uniform recurrence equations, we study an algorithm first proposed by Karp, Miller and Winograd for detecting cycles of null weight in cyclic graphs. We show how this algorithm can be...
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...