mirage

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par titre

Système d'archivage DSpace/Manakin

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par titre

Tri par : Ordre : Résultats :

  • Laboratoire de l'informatique du parallélisme; Ferreira, Afonso; Guérin-Lassous, Isabelle; Marcus, Karina; Rau-Chaplin, Andrew (2000-12)
    (eng) This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of interval graph problems. Included are algorithms requiring only a constant number of communication rounds for ...
  • Laboratoire de l'informatique du parallélisme; Brunie, Lionel; Exbrayat, Matthieu; Flory, André (1999-03)
    (eng) In this paper we propose an innovative approach to handle ``read-most'' data bases. This approach is based on a parallel extension, called parallel relational query evaluator, working over a network of workstations, ...
  • Laboratoire de l'informatique du parallélisme; Dupont de Dinechin, Benoît; Monat, Christophe; Rastello, Fabrice (2001-07)
    (eng) This report addresses the problem of improving the execution performance of saturated reduction loops on fixed-point instruction-level parallel Digital Signal Processors (DSPs). We first introduce ``bit-exact'' ...
  • 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; Yahya Ould Mohamed El Hadj; Revol, Nathalie (2001-01)
    (eng) The automatic recognition of spoken words is increasingly common, for dictaphone applications, telephone services or the command of various devices by disabled persons. In the latter case, a high recognition rate is ...
  • Laboratoire de l'informatique du parallélisme; Rastello, Fabrice; Dauxois, Thierry (2001-11)
    (eng) In this paper, we present an efficient and simple solution to the parallelization of discrete integration programs of ordinary differential equations (ODE). The main technique used is known as loop tiling. To avoid ...
  • Laboratoire de l'informatique du parallélisme; Adamo, Jean-Marc; Trejo, Luis (1994-01-17)
    (eng) Cole presented a parallel merge sort for the PRAM model that performs in log n parallel steps using n processors. He gave an algorithm for the CREW PRAM model for which the constant in the running time is small. He ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Utard, Gil (2002-01)
    (eng) This paper presents a parallel out-of-core algorithm to invert huge matrices, that is when size of matrices is larger than the available physical memory by one or more orders of magnitude. Preliminary performance ...
  • Detrey, Jérémie; de Dinechin, Florent; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) As FPGAs are increasingly being used for floating-point computing, the feasibility of a library of floating-point elementary functions for FPGAs is discussed. An initial implementation of such a library contains ...
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel (2002-10)
    (eng) We aim at evaluating elementary and special functions using small tables and small, rectangular, multipliers. To do that, we show how accurate polynomial approximations whose order-$1$ coefficients are small in size ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (2000-03)
    (eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s_1, s_2,..., s_p (such that the sum of the s_i is ...
  • 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; Bodini, Olivier (2001-12)
    (eng) In this paper, we answer to a question of Grunbaum by proving that, for all set F of polyominoes (union of unit squares of a square lattice), we can find a Z-tiling (signed tile) of polyominoes by copies of elements ...
  • Laboratoire de l'informatique du parallélisme; Bouillard, Anne; Gaujal, Bruno (2005-03)
    (eng) In this paper, we show how to design a perfect simulation for Markovian fork-join networks, or equivalently, free-choice Petri nets. For pure fork-join networks and for event graphs, the simulation time can be greatly ...
  • Laboratoire de l'informatique du parallélisme; Goglin, Brice; Prylli, Loïc (2003-04)
    (eng) We study the performance of file servers, comparing NFS implementation in Linux to our experimental lightweight system called ORFA. The aim is to find out NFS bottlenecks in the case of high bandwidth local network. ...
  • Laboratoire de l'informatique du parallélisme; Maimour, Moufida (2004-03)
    (eng) Since it is required by many emerging Internet applications, reliable multicast has received significant attention in the networking research community. Scalability to a large number of receivers is one of the key ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Marchal, Loris (2004-07)
    (eng) In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes, for example to ...
  • Caron, Eddy; Chis, Andréa; Desprez, Frédéric; Su, Alan; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) This report presents the approach chosen within the DIET (Distributed Interactive Engineering Toolbox) project a Grid-RPC environment to allow a resource broker to be tuned for specific application classes. Our ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-02)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication ...
  • Laboratoire de l'informatique du parallélisme; Cucker, Felipe; Koiran, Pascal; Smale, Steve (1997-11)
    (eng) We show that the integer roots of of a univariate polynomial with integer coefficients can be computed in polynomial time. This result holds for the classical (i.e. Turing) model of computation and a sparse representation ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share