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:

  • Laboratoire de l'informatique du parallélisme; Durand-Lose, Jérôme (2004-04)
    (eng) The Black hole model of computation provides a computing power that goes beyond the classical Turing computability since it offers the possibility to decide in finite time any recursively enumerable (\RE) problem. ...
  • Laboratoire de l'informatique du parallélisme; Durand-Lose, Jérôme (2004-03)
    (eng) In the Cellular Automata (CA) literature, discrete lines inside (discrete) space-time diagrams are often idealized as Euclidean lines in order to analyze a dynamics or to design CA for special purposes. In this ...
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel (2002-08)
    (eng) We present techniques for accelerating the floating-point computation of x/y when y is known before x. The goal is to get exactly the same result as with usual division with rounding to nearest. These techniques can ...
  • Laboratoire de l'informatique du parallélisme; Goglin, Brice; Glück, Olivier; Vicat-Blanc Primet, Pascale (2004-12)
    (eng) L'exécution performante d'applications parallèles sur grappes de calcul interconnectées par des réseaux hautes performances nécessite des communications efficaces entre les processus de calcul mais aussi des accès ...
  • Laboratoire de l'informatique du parallélisme; Maimour, Moufida (2004-02)
    (eng) A multicast session can involve multiple receivers with different capacities. To accommodate this heterogeneity, we propose a new replication mechanism which allows for a fine-grained multi-rate congestion control. ...
  • Laboratoire de l'informatique du parallélisme; Bournez, Olivier (1997-05)
    (eng) We study the computational power of rational Piecewise Constant Derivative (PCD) systems. PCD systems are dynamical systems defined by a piecewise constant differential equation and can be considered as computational ...
  • Laboratoire de l'informatique du parallélisme; Le Roux, Stéphane (2007-03)
    (eng) Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{i.e.}, topological sorting of finite partial orders, arose in the late 1950's. However, those issues have not yet ...
  • Le Roux, Stéphane; Laboratoire de l'informatique du parallélisme (LIP, 2007-05)
    Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of the proof are as follows: First, a procedure ...
  • Laboratoire de l'informatique du parallélisme; Chich, Thierry (1997-08)
    (eng) In this paper, we describe a new adaptive routing algorithm for meshed-topology deflection networks. Our algorithm is based on a local learning method which evolves in order to produce a local spatial representation ...
  • Laboratoire de l'informatique du parallélisme; Desprez, Frédéric; Jeannot, E. (2001-12)
    (eng) The implementation of Network Enabled Servers (NES) on grid environments requires to lower the cost of communications. NetSolve, a NES environment developed at University of Tennessee Knoxville, sends data back to ...
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Langlois, Philippe (2001-02)
    (eng) An additive symmetric b of a with respect to c satisfies c = (a+b)/2. Existence and uniqueness of such b are basic properties in exact arithmetic that fail when a and b are floating point numbers and the computation ...
  • Laboratoire de l'informatique du parallélisme; Lang, Frédéric; Dougherty, Daniel; Lescanne, Pierre; Rose, Kristoffer (1999-06)
    (eng) We propose Addressed Term Rewriting Systems (ATRS) as a solution to the still-standing problem of finding a simple yet formally useful framework that can account for computation with sharing, cycles, and side effects. ...
  • Laboratoire de l'informatique du parallélisme; Brisebarre, Nicolas (2003-11)
    (eng) We present an algorithm that computes the entire solutions of systems of two difference equations and of systems of one differential equation and one difference equation, all with complex polynomials coefficients. ...
  • Laboratoire de l'informatique du parallélisme; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (1999-03)
    (eng) Future computing platforms will be distributed and heterogeneous. Such platforms range from heterogeneous networks of workstations (NOWs) to collections of NOWs and parallel servers scattered throughout the world and ...
  • Laboratoire de l'informatique du parallélisme; Mehaut, Jean-Francois; Robert, Yves (1999-08)
    (eng) We discuss algorithms and tools to help program and use metacomputing resources in the forthcoming years. Metacomputing with highly distributed heterogeneous environments stands to become a major, if not dominant, ...
  • Laboratoire de l'informatique du parallélisme; Lefevre, Vincent (1997-06)
    (eng) We give a fast algorithm for computing a lower bound on the distance between a straight line and the points of a regular grid. This algorithm is used to find worst cases when trying to round the elementary functions ...
  • Laboratoire de l'informatique du parallélisme; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (1998-07)
    (eng) In this paper, an efficient algorithm to simultaneously implement array alignment and data/computation distribution is introduced and evaluated. We re-visit previous work of Li and Chen, and we show that their alignment ...
  • Caron, Eddy; Desprez, Frédéric; Loureiro, David; Laboratoire de l'informatique du parallélisme (LIP, 2008-07-01)
    (ENG) Grid Middleware are the link between large scale (and distributed) platforms and applications. Managing such a software system and the Grid environment itself can be a hard task when no dedicated (and integrated) ...
  • Laboratoire de l'informatique du parallélisme; Gaujal, Bruno; Navet, Nicolas; Walsh, Cormac (2003-07)
    (eng) We present an algorithm for scheduling a set of non-recurrent tasks (or jobs) with real-time constraints so as to minimize the total energy consumption on a dynamically variable voltage processor. Our algorithm runs ...
  • Laboratoire de l'informatique du parallélisme; Maimour, Moufida; Pham, Cong-Duc (2003-01)
    (eng) Many works have recently addressed the issue of congestion control for multicast communications and the problem is known to be highly complex. Scalability, responsiveness, stability and fairness with TCP are some of ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share