mirage

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Title

DSpace/Manakin Repository

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Title

Sort by: Order: Results:

  • Desprez, Frédéric; Fleury, Eric; Loi, Michel; Laboratoire de l'informatique du parallélisme (LIP, 1993-02)
    (eng) This document describes the INMOS IMS T9000, the latest member in the transputer family anf the IMS C104, a complete routing switch. This transputer combines a general purpose processor with a grouping of instructions, ...
  • Laboratoire de l'informatique du parallélisme; Detrey, Jérémie; de Dinechin, Florent (2004-11)
    (eng) Many general table-based methods for the evaluation in hardware of elementary functions have been published. The bipartite and multipartite methods implement a first-order approximation of the function using only ...
  • Laboratoire de l'informatique du parallélisme; Lefevre, Vincent; Muller, Jean-Michel; Tisserand, Arnaud (1998-02)
    (eng) The Table Maker's Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped ...
  • Laboratoire de l'informatique du parallélisme; Rastello, Fabrice; Pande, Santosh; Rao, Amit (1998-02)
    (eng) In this report we address the issue of loop tiling to minimize the completion time of the loop when executed on multicomputers. We remove the restriction of atomicity of tiles and internal parallelism within tiles ...
  • Laboratoire de l'informatique du parallélisme; Revol, Nathalie; Makino, Kyoko; Berz, Martin (2003-02)
    (eng) The goal of this paper is to prove that the implementation of Taylor models in COSY, based on floating-point arithmetic, computes results satisfying the ``containment property'', i.e. guaranteed results.
  • Guillier, Romaric; Soudan, Sébastien; Vicat-Blanc Primet, Pascale; Laboratoire de l'informatique du parallélisme (LIP, 2007-07)
    (ENG) In high performance distributed computing applications, data movements have demanding performance requirements such as reliable and predictable delivery. Predicting the throughput of large transfers is very difficult ...
  • Desprez, Frédéric; Gavoille, Cyrille; Jargot, Bruno; Pourzandi, Makan; Laboratoire de l'informatique du parallélisme (LIP, 1993-03)
    (eng) In this document we present the distributed memory computer ARCHIPEL VolVox IS-860 and different programming environments TROLLIUS 2.1, VOLCOM 1.0 and VOLCOM 2.0. We measure the performances for different levels of ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (2002-03)
    (eng) A Liouville function is a complex analytic function H with a Taylor series \sum_{n=1}^{\infty} x^n/a_n such the a_n's form a ``very fast growing'' sequence of integers. In this paper we exhibit the complete first-order ...
  • Laboratoire de l'informatique du parallélisme; Bodini, Olivier; Remila, Eric (2002-11)
    (eng) We fix two rectangles with integer dimensions. We give a quadratic time algorithm which, given a polygon $F$ as input, produces a tiling of $F$ with translated copies of our rectangles (or indicates that there is no ...
  • Laboratoire de l'informatique du parallélisme; Boulet, Pierre; Dongarra, Jack; Robert, Yves; Vivien, Frédéric (1998-01)
    (eng) In the framework of fully permutable loops, tiling has been extensively studied as a source-to-source program transformation. However, little work has been devoted to the mapping and scheduling of the tiles on physical ...
  • Laboratoire de l'informatique du parallélisme; Moore, P. Cristopher; Rapaport, Ivan; Rémila, Eric (2001-09)
    (eng) We apply tiling groups and height functions to tilings of regions in the plane by Wang tiles(squares with colored boundaries) where the colors of shared edges must match. We define a set of tiles as unambiguous if ...
  • Laboratoire de l'informatique du parallélisme; Gaujal, Bruno; Giua, Alessandro (2002-10)
    (eng) In this paper, we consider a deterministic timed continuous Petrinet model where conflicts at places are solved by usingstationary routing parameters. We show how to compute thestationary firing rate for all transitions ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (2000-11)
    (eng) We show that it is impossible to compute (or even to approximate) the topological entropy of a continuous piecewise affine function in dimension 4. The same result holds for saturated linear functions in unbounded ...
  • Laboratoire de l'informatique du parallélisme; Duboux, Thibault; Ferreira, Afonso (1994-12-21)
    (eng) The fast development over the last years of high performance multicomputers makes them attractive candidates as the base technology for scalable and performance oriented database applications. In this paper, we address ...
  • Laboratoire de l'informatique du parallélisme; Roeckl, Christine; Hirschkoff, Daniel; Berghofer, Stefan (2000-06)
    (eng) Higher order abstract syntax is a natural way to formalize programming languages with binders, like the pi-calculus, because alpha-conversion and beta-reduction are delegated to the meta level of the provers, making ...
  • Laboratoire de l'informatique du parallélisme; Bassi, Alessandro; Laganier, Julien (2003-03)
    (eng) Some security problems can be often solved through authorization rather than authentication. Furthermore, authorization approach avoids usual drawbacks of centralized systems such as bottlenecks or single point of ...
  • Laboratoire de l'informatique du parallélisme; Agullo, Emmanuel; Guermouche, Abdou; L'Excellent, Jean-Yves (2007-02)
    (eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems involving sparse systems of linear equations of the form A x = b. This report describes a prototype implementation of an ...
  • Antoniu, Gabriel; Caron, Eddy; Desprez, Frédéric; Jan, Matthieu; Laboratoire de l'informatique du parallélisme (LIP, 2006-12)
    (eng) As grids become more and more attractive for solving complex problems with high computational and storage requirements, the need for adequate grid programming models is considerable. To this purpose, the GridRPC ...
  • Guillier, Romaric; Hablot, Ludovic; Vicat-Blanc Primet, Pascale; Laboratoire de l'informatique du parallélisme (LIP, 2007-07)
    (ENG) Standard TCP faces some performance limitations in very high speed wide area networks, mainly due to a long end-to-end feedback loop and a conservative behaviour with respect to congestion. Many TCP variants have ...
  • Laboratoire de l'informatique du parallélisme; de Dinechin, Florent; Luk, Wayne; McKeever, Steve (1999-10)
    (eng) Field Programmable Gate Arrays (FPGAs) are usually programmed using languages and methods inherited from the domain of VLSI synthesis. These methods, however, have not always been adapted to the new possibilities ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share