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 :

  • Lopez Pacheco, Dino M.; Lefèvre, Laurent; Pham, Congduc; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) This report presents improvements of the eXplicit Control Protocol (XCP) in order to support fairness between XCP and TCP flows. Our mechanisms are based on two main components: estimations of the resources needed ...
  • Laboratoire de l'informatique du parallélisme; Beuchat, Jean-Luc (2004-09)
    (eng) In this paper, we first describe a novel modulo $(2^n+1)$ addition algorithm suited to FPGA and ASIC implementations, and discuss several architectures of multioperand modulo $(2^n+1)$ adders. Then, we propose three ...
  • de Dinechin, Florent; Lauter, Christoph; Muller, Jean-Michel; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the ...
  • Laboratoire de l'informatique du parallélisme; de Dinechin, Florent; Defour, David; Lauter, Christophe (2004-03)
    (eng) This article shows that IEEE-754 double-precision correct rounding of the most common elementary functions (exp/log, trigonometric and hyperbolic) is achievable on current processors using only double-double-extended ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) Fault tolerance and latency are important requirements in several applications which are time critical in nature: such applications require guaranties in terms of latency, even when processors are subject to ...
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel (1998-10)
    (eng) Table-based methods are frequently used to implement functions. We examine some methods introduced in the literature, and we introduce a generalization of the bipartite table method, named the multipartite table method.
  • Laboratoire de l'informatique du parallélisme; Dumas, J.G.; Giorgi, P.; Pernet, C. (2004-01)
    (eng) The FFLAS project has established that exact matrix multiplication over finite fields can be performed at the speed of the highly optimized numerical BLAS routines. Since many algorithms have been reduced to use ...
  • Charbit, Pierre; Jeandel, Emmanuel; Koiran, Pascal; Perifel, Sylvain; Thomasse, Stefan; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) Dimitri Grigoriev has shown that for any family of N vectors in the ddimensional linear space E = (F2)d, there exists a vector in E which is orthogonal to at least N/3 and at most 2N/3 vectors of the family. We show ...
  • Laboratoire de l'informatique du parallélisme; Brisebarre, Nicolas; Muller, Jean-Michel (2003-04)
    (eng) When implementing regular enough functions (e.g., elementary or special functions) on a computing system, we frequently use polynomial approximations. In most cases, the polynomial that best approximates (for a given ...
  • Laboratoire de l'informatique du parallélisme; Eyraud-Dubois, Lionel; Legrand, Arnaud; Quinson, Martin; Vivien, Frédéric (2007-02)
    (eng) To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must uses tools which automatically build ...
  • Bin Bin Chen; Primet, Pascale (LIP, 2006-05)
    (eng) In grid networks, distributed resources are interconnected by wide area network to support compute and data-intensive applications, which require reliable and efficient transfer of gigabits (even terabits) of ...
  • Laboratoire de l'informatique du parallélisme; Prost, Frederic (1999-01)
    (eng) We propose a variant of Girard's System F. The aim of this new system is to provide a common framework for various type based analyses. We modify $F$ by the introduction of two different universes from which types ...
  • Laboratoire de l'informatique du parallélisme; Dargenton, Pierre; Hirschkoff, Daniel; Lescanne, Pierre; Pommateau, E. (2001-08)
    (eng) In this paper, we develop a formal specification for a micro-payment protocol, first on paper, then within the Coq proof assistant. Our approach in defining a notion of
  • Laboratoire de l'informatique du parallélisme; Beuchat, Jean-Luc; Sendrier, Nicolas; Tisserand, Arnaud; Villard, Gilles (2004-03)
    (eng) An algorithm producing cryptographic digital signatures less than 100 bits long with a security level matching nowadays standards has been recently proposed by Courtois, Finiasz, and Sendrier. This scheme is based ...
  • Laboratoire de l'informatique du parallélisme; Lang, Frédéric; Lescanne, Pierre; Liquori, Luigi (1998-12)
    (eng) In this paper, we give a general framework for the foundation of an operational (small step) semantics of object-based languages with an emphasis on functional and imperative issues. The framework allows classifying ...
  • Laboratoire de l'informatique du parallélisme; Suter, Frédéric; Casanova, Henri; Desprez, Frédéric; Boudet, Vincent (2003-11)
    (eng) Mixed-parallelism, the combination of data- and task-parallelism, is a powerful way of increasing the scalability of entire classes of parallel applications. Exploiting both types of parallelism simultaneously makes ...
  • Laboratoire de l'informatique du parallélisme; Fatès, Nazim; Morvan, Michel; Schabanel, Nicolas; Thierry, Eric (2005-02)
    (eng) In this paper we propose a probabilistic analysis of the fully asynchronous behavior (i.e., two cells are never simultaneously updated, as in a continuous time process) of elementary finite cellular automata (i.e., ...
  • Duchon, Philippe; Hanusse, Nicolas; Lebhar, Emmanuelle; Schabanel, Nicolas; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) We investigate the problem of efficiently preprocessing a large network, in a fully distributed manner, so that the resulting network is a navigable small world. Namely, if the network has bounded growth, by adding ...
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Matula, David W. (2000-03)
    (eng) Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant ...
  • Antoniu, Gabriel; Bertier, Marin; Bougé, Luc; Caron, Eddy; Desprez, Frédéric; Jan, Matthieu; Monnet, Sébastien; Sens, Pierre; Laboratoire de l'informatique du parallélisme (2005-06)
    (eng) Grid computing has recently emerged as a response to the growing demand for resources (processing power, storage, etc.) exhibited by scientific applications. We address the challenge of sharing large amounts of data ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share