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; Imbert, Laurent; Muller, Jean-Michel; Rico, Fabien (1999-09)
    (eng) We present a radix-10 variant of the BKM algorithm. It is a shift-and-add, CORDIC-like algorithm that allows fast computation of complex exponentials and logarithms. This radix-10 version is suitable for implementation ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (1997-10)
    (eng) We show that computing the dimension of a semi-algebraic set of R^n is an NP-complete problem in the Blum-Shub-Smale model of computation over the reals. Since this problem is easily seen to be NPR-hard, the main ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Boudet, Vincent; Robert, Yves (2001-09)
    (eng) Scheduling computational tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-02)
    (eng) Abstract Most list scheduling heuristics rely on a simple platform model where communication contention is not taken into account. In addition, it is generally assumed that processors in the systems are completely ...
  • Laboratoire de l'informatique du parallélisme; Marchal, Loris; Yang Yang; Casanova, Henri; Robert, Yves (2004-04)
    (eng) Divisible load applications consist of an amount of data and associated computation that can be divided arbitrarily into any number of independent pieces. This model is a good approximation of many real-world scientific ...
  • Laboratoire de l'informatique du parallélisme; Ercegovac, Milos; Lang, Tomas; Muller, Jean-Michel; Tisserand, Arnaud (1997-11)
    (eng) 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 ``large'' (almost ...
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Matula, David W. (1997-01)
    (eng) 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 are each associated ...
  • Laboratoire de l'informatique du parallélisme; Tougne, Laure (1995-01-31)
    (eng) We consider a family of figures of the discrete plane (rectangles, squares, ellipses,...); how shall we decide with a 2D cellular automaton whether a given figure belongs to the family or not? We essentially give ...
  • Laboratoire de l'informatique du parallélisme; Matamala, Martin (1993-12-11)
    (eng) We present a strategy in order to build neural networks with long steady state periodic behavior. This strategy allows us to obtain 2^n non equivalent neural networks of size n, when the equivalence relation is the ...
  • Agullo, Emmanuel; Guermouche, Abdou; L'Excellent, Jean-Yves; Laboratoire de l'informatique du parallélisme (LIP, 2007-05)
    (eng) High performance sparse direct solvers are often a method of choice in various simulation problems. However, they require a large amount of memory compared to iterative methods. In this context, out-of-core solvers ...
  • Boulet, Pierre; Dion, Michèle; Lequiniou, Eric; Risset, Tanguy; Laboratoire de l'informatique du parallélisme (LIP, 1994-10)
    (eng) This documents presents the first version of the Bouclettes automatic parallelizer developed at LIP. It gives a detailed description of the functionalities and internal mechanics of the parallelizer, from the graphical ...
  • Bouchez, Florent; Darte, Alain; Guillon, Christophe; Rastello, Fabrice; Laboratoire de l'informatique du parallélisme (2005-08)
    (eng) This report deals with the problem of choosing which variables to spill during the register allocation phase. Spilling is used when the number of variables is higher than the number of registers, and consists of ...
  • Bouchez, Florent; Darte, Alain; Rastello, Fabrice (LIP, 2006-03)
    (eng) Register allocation is one of the most studied problem in compilation. It is considered as an NP-complete problem since Chaitin, in 1981, showed that assigning temporary variables to k machine registers amounts to ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Hatcher, Philip (2001-01)
    (eng) Our work combines Java compilation to native code with a run-time library that executes Java threads in a distributed-memory environment with true parallelism. To provide the illusion of a shared memory to Java ...
  • Caron, Eddy; Desprez, Frédéric; Fourdrignier, Charles; Petit, Franck; Tedeschi, Cédric; Laboratoire de l'informatique du parallélisme (LIP, 2006-10)
    (eng) Facing the limits of traditional tools of resource management within computational grids (related to scale, dynamicity, etc. of the platforms newly considered), new approaches, based on peer-to-peer technologies are ...
  • Benoit, Anne; Casanova, Henri; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    In this paper we consider the operator mapping problem for in-network stream processing applications. In-network stream processing consists in applying a tree of operators in steady-state to multiple data objects that are ...
  • Laboratoire de l'informatique du parallélisme; Dion, Michèle; Risset, Tanguy; Robert, Yves (1994-06-27)
    (eng) We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arrays. Resource constraints are taken into account: not only we assume a limited number of available processors, but ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Desprez, Frédéric; Petit, Franck; Tedeschi, Cédric (2004-12)
    (eng) DIET (Distributed Interactive Engineering Toolbox) is a set of hierarchical components to design Network Enabled Server systems. These systems are built upon servers managed through distributed scheduling agents for ...
  • 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 ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share