mirage

Browsing Informatique / Computer science by Issue Date

DSpace/Manakin Repository

Browsing Informatique / Computer science by Issue Date

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Prylli, Loïc (1995-05)
    (eng) Our work deals with simulation of distributed memory parallel computers. The tool we realized allows to take an application written for say an Intel Paragon and run it on a workstations cluster by just recompiling ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Vivien, Frédéric (1995-05-24)
    (eng) In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use different representations of distance vectors ...
  • Ubéda, Stéphane; Vigouroux, Xavier; Laboratoire de l'informatique du parallélisme (LIP, 1995-07)
    (eng) This report presents the work done to parallelize a quantization algorithm of color images on a LAN of workstations. The quantization consists in reducing the number of colors in order to reduce the length of an ...
  • Laboratoire de l'informatique du parallélisme; Calland, Pierre-Yves; Mignotte, Anne; Peyran, Olivier; Robert, Yves; Vivien, Frédéric (1995-09)
    (eng) The increasing complexity of digital circuitry makes global design optimization no longer possible: a designer will only consider the critical parts of his circuit. This paper discusses timing optimization problems ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire (1995-09)
    (eng) Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, ...
  • Laboratoire de l'informatique du parallélisme; Karp, Richard M.; Kenyon, Claire; Waarts, Orli (1995-09)
    (eng) The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives, extract-a-bit, merge-two-tubes and detect-emptiness. Perfect operations can test the satisfiability ...
  • Laboratoire de l'informatique du parallélisme; Gegout, Cedric; Girau, Bernard; Rossi, Fabrice (1995-09)
    (eng) We present a general model for differentiable feed-forward neural networks. Its general mathematical description includes the standard multi-layer perceptron as well as its common derivatives. These standard structures ...
  • Laboratoire de l'informatique du parallélisme; Allauzen, Cyril; Durand, Bruno (1995-09)
    (eng) We study some decision problems concerning the tiling of the plane with Wang tiles. We present a proof for the undecidability of the tiling problem for the whole plane, and also for the periodic tiling. In these ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire; Rabani, Yuval; Sinclair, Alistair (1995-09)
    (eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range{1/k,2/k,...,j/k}. Our main ...
  • Laboratoire de l'informatique du parallélisme; Fraigniaud, Pierre; Vial, Sandrine (1995-09)
    (eng) Broadcasting and gossiping are known to be NP-hard problems. This paper deals with approximation algorithms for such problems. We consider both round-complexity and step-complexity in the telephone model. After an ...
  • Laboratoire de l'informatique du parallélisme; Paulin-Mohring, Christine (1995-09)
    (eng) This paper presents the proof of correctness of a multiplier circuit formalized in the calculus of inductive constructions. It uses a representation of the circuit as a function from the stream of inputs to the stream ...
  • Laboratoire de l'informatique du parallélisme; Prylli, Loïc; Tourancheau, Bernard (1995-10)
    (eng) Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors. Block-cyclic distribution seems to suit well for most ...
  • Laboratoire de l'informatique du parallélisme; Bournez, Olivier; Cosnard, Michel (1995-10)
    (eng) We explore the simulation and computational capabilities of dynamical systems. We first introduce and compare several notions of simulation between discrete systems. We give a general framework that allows dynamical ...
  • Laboratoire de l'informatique du parallélisme; Dion, Michèle; Randriamaro, Cyril; Robert, Yves (1995-10)
    (eng) Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step : as it is generally impossible to obtain ...
  • Laboratoire de l'informatique du parallélisme; Boulet, Pierre; Brandes, Thomas (1995-11)
    (eng) In the data parallel programming style the user usually specifies the data parallelism explicitly so that the compiler can generate efficient code without enhanced analysis techniques. In some situations it is not ...
  • Laboratoire de l'informatique du parallélisme; Boulet, Pierre; Dion, Michèle (1995-11)
    (eng) 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 and parallel ...
  • Laboratoire de l'informatique du parallélisme; Eberhardt, Regina; Paugam-Moisy, Helene; Puzenat, Didier; Royet, Jean-Pierre (1995-11)
    (eng) Several experiments have been performed in order to study the cognitive processes which are involved in odor recognition. The current report summarizes experimental protocol and analyzes collected data. The goal is ...
  • Laboratoire de l'informatique du parallélisme; Boulet, Pierre (1995-11)
    (eng) 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 and parallel ...
  • Laboratoire de l'informatique du parallélisme; Calland, Pierre-Yves; Darte, Alain; Robert, Yves (1995-11)
    (eng) 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 its deep link with ...
  • Laboratoire de l'informatique du parallélisme; Prylli, Loïc (1995-12)
    (eng) We present here the use, the implementation and the performances, of the usual message-passing libraries NX, PVM and MPI on the Capitan machine. In particular, the implementation of a multi-user environment is described.

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share