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; Boldo, Sylvie; Daumas, Marc (2002-11)
    (eng) Studying floating point arithmetic, authors have shown that the implemented operations (addition, subtraction, multiplication, division and square root) can compute a result and an exact correcting term using the ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Schreiber, Robert (2004-12)
    (eng) We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the barrier minimization problem. No full ...
  • Laboratoire de l'informatique du parallélisme; Silber, Georges-Andre; Darte, Alain (1998-09)
    (eng) We describe Nestor, a library to easily manipulate Fortran programs through a high level internal representation based on C++ classes. Nestor is a research tool that can be used to quickly implement source to source ...
  • Laboratoire de l'informatique du parallélisme; Casanova, Henri; Marchal, Loris (2002-10)
    (eng) In this work we investigate network models that can be potentiallyemployed in the simulation of scheduling algorithms for distributedcomputing applications. We seek to develop a model of TCP communicationwhich is ...
  • Laboratoire de l'informatique du parallélisme; Thierry, Eric (2003-10)
    (eng) This paper provides a new upper bound on the 2-dimension of partially ordered sets. The 2-dimension of an ordered set P is the smallest
  • 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; Defour, P. David; Kornerup, Peter; Muller, Jean-Michel; Revol, Nathalie (2001-09)
    (eng) Range reduction is a key point for getting accurate elementary function routines. We introduce a new algorithm that is fast for input arguments belonging to the most common domains, yet accurate over the full double ...
  • Laboratoire de l'informatique du parallélisme; Defour, David; de Dinechin, Florent; Muller, Jean-Michel (2002-11)
    (eng) This paper presents a new scheme for the hardware evaluation of functions in fixed-point format, for precisions up to 30 bits. This scheme yields an architecture made of four look-up tables, a multi-operand adder, ...
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel; Nicolas, Jean-Louis; Roblot, Xavier-François (2003-10)
    (eng) Let us denote by Q(N,\la) the number of solutions of the diophantine equation A^2+B^2=C^2+C satisfying N\le A\le B\le C \le \la N-\frac 12. We prove that, for \la fixed and N\to \iy, there exists a constant \al(\la) ...
  • Scherrer, Antoine; Larrieu, Nicolas; Owezarski, Philippe; Borgnat, Pierre; Abry, Patrice; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) The Internet aims at providing a wide range of services for a large variety of applications. Hence, it is highly sensitive to traffic anomalies (e.g., failures, flash crowds,...) as well as to DoS attacks, which are ...
  • Laboratoire de l'informatique du parallélisme; Beckermann, Bernd; Labahn, George; Villard, Gilles (2002-01)
    (eng) We present an algorithm for the computation of a shifted Popov Normal Form of a rectangular polynomial matrix. For specific input shifts, we obtain methods for computing the matrix greatest common divisor of two ...
  • Laboratoire de l'informatique du parallélisme; Pierre Fraigniaud (1996-01)
    (eng) In this paper, we deal with the XRAM model introduced in [3]. We mainly show that the original definition of the XRAM model was not consistent, and must be slightly modified. Therefore, we modify the definition of ...
  • Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (2000-12)
    (eng) This paper presents a survey of the state-of-the-art techniques and prototypes for compressing videos. A particular interest is devoted to compression for streaming over the Internet. The basic principles are presented, ...
  • Caniou, Yves; Caron, Eddy; Charrier, Ghislain; Chis, Andrea; Desprez, Frédéric; Maisonnave, Eric; Laboratoire de l'informatique du parallélisme (LIP, 2008-07)
    (eng) In this report, we tackle the problem of scheduling an Ocean-Atmosphere application used for climate prediction on the grid. An experiment is composed of several 1D-meshes of identical DAGs composed of parallel ...
  • Pineau, Jean-François; Robert, Yves; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (2005-07)
    'eng) In this work, we deal with the problem of scheduling independent tasks on heterogeneous master-slave platforms. We target both off-line and on-line problems, with several objective functions (makespan, maximum response ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Su, Alan; Vivien, Frédéric (2004-11)
    (eng) In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We show that this problem lies in the divisible load framework. In this framework, we propose a polynomial-time ...
  • Laboratoire de l'informatique du parallélisme; Nouvel, Bertrand; Remila, Eric (2003-06)
    (eng) We consider a non numerable family of colorations induced by discrete rotations. The symbolical dynamical system associated with the coloration is first explained. We introduce then a group that supports the dynamics ...
  • Laboratoire de l'informatique du parallélisme; Formenti, Enrico; Kurka, Petr (1998-01)
    (eng) We prove that the topological space szd, proposed in is path-connected and has infinite dimension. The latter property makes of this space a more natural setting for cellular automata when they are considered as a ...
  • Laboratoire de l'informatique du parallélisme; Bodini, Olivier; Rémila, Eric (2002-05)
    (eng) This paper studies the tricolorations of edges of triangulations of simply connected orientable surfaces such that the degree of each interior vertex is even. Using previous results on lozenge tilings, we give a ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share