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; Beaumont, Olivier; Carter, Larry; Ferrante, Jeanne; Legrand, Arnaud; Robert, Yves (2001-06)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing efforts like SETI@home. ...
  • Quirin Lauter, Christoph; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) The implementation of correctly rounded elementary functions needs high intermediate accuracy before final rounding. This accuracy can be provided by (pseudo-) expansions of size three, i.e. a triple-double format. ...
  • 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; 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 ...
  • Benoit, Anne; Kosch, Harald; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-01)
    (eng) Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput and ...
  • Prylli, Loïc; Tourancheau, Bernard; Laboratoire de l'informatique du parallélisme (LIP, 1997-09)
    (eng) BIP stands for Basic Interface for Parallelism. It is a message-passing system implementation on top of Myrinet. It achieves one Gigabit/s bandwidth and less than 5 us latency. This manual describes the whole BIP ...
  • 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 ...
  • Fournel, Nicolas; Fraboulet, Antoine; Feautrier, Paul; Laboratoire de l'informatique du parallélisme (LIP, 2006-02)
    (eng) This research report presents a full case study on porting and booting the Linux and uCLinux operating system on a new platform. We present this work on the ARM Excalibur CM922TXA10 for which a new machine type has ...
  • 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; Lang, Tomas; Muller, Jean-Michel (2000-11)
    (eng) This paper presents upper bounds on the number of zeros and ones after the rounding bit for algebraic functions. These functions include reciprocal, division, square root, and inverse square root, which have been ...
  • Laboratoire de l'informatique du parallélisme; Hirschkoff, Daniel (2003-02)
    (eng) This document collects some important results about the theory of Milner's pi-calculus and related formalisms. We present the syntax and semantics of a monadic calculus, and discuss type systems and the most commonly ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Marchal, Loris; Robert, Yves (2004-11)
    (eng) In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree ...
  • Laboratoire de l'informatique du parallélisme; Chaudet, Claude; Guérin-Lassous, Isabelle (2001-07)
    (eng) This paper deals with the bandwidth reservation problem in ad hoc networks and with the influence that interferences between signals have on it. We show that interferences could decrease the applications rates. This ...
  • Laboratoire de l'informatique du parallélisme; Defour, David (2002-10)
    (eng) The ratio between processor speed and memory speed frequently makes efficient use of cache memory a very important element in performance of user's application. This is the case for many elementary function algorithms. ...
  • Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (1999-11)
    (eng) This paper presents a survey of the state-of-the-art techniques and prototypes for Web caches. The basic principles are presented, the most important hardwares and softwares approaches are described.
  • 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.
  • Laboratoire de l'informatique du parallélisme; Hains, Gaetan; Mullins, John (1994-12-27)
    (eng) We apply the theory of generalised concrete data structures (or gCDSs) to construct a cartesian closed category of concrete array structures with explicit data layout. The technical novelty is the array gCDS preserved ...
  • Laboratoire de l'informatique du parallélisme; Blanchard, Francois; Formenti, Enrico; Kurka, Petr (1998-06)
    (eng) The Besicovitch and Weyl pseudometrics on the space $A^{\ZZ}$ of biinfinite sequences measure the density of differences in either the central or arbitrary segments of given sequences. The Besicovitch and Weyl spaces ...
  • Chevillard, Sylvain; Joldes, Mioara; Lauter, Christoph; Laboratoire de l'informatique du parallélisme (LIP, 2008-10)
    (ENG) In many numerical programs there is a need for a high-quality floating-point approximation of useful functions f, such as exp, sin, erf. In the actual implementation, the function is replaced by a polynomial p, ...
  • Chevillard, Sylvain; Lauter, Christoph Quirin; Laboratoire de l'informatique du parallélisme (LIP, 2007-06)
    (eng) The high-quality floating-point implementation of useful functions f : R → R, such as exp, sin, erf requires bounding the error ε = p−f f of an approximation p with regard to the function f. This involves bounding ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share