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 :

  • 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 ...
  • Laboratoire de l'informatique du parallélisme; Bodini, Olivier; Latap, Matthieu (2001-12)
    (eng) In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous tilings of polyominoes with dominoes). ...
  • Laboratoire de l'informatique du parallélisme; Mazoit, Frédéric (2004-06)
    (eng) We adapt some decision theorems about treewidth to the branchwidth and use this theorems to prove that the branchwidth of circular-arc graphs can be computed in polynomial time.
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Melquiond, Guillaume (2004-07)
    (eng) We present a new tool that generates bounds on the values and the round-off errors of programs using floating point operations. The tool is based on forward error analysis and interval arithmetic. The novelty of our ...
  • Depardon, Benjamin; Laboratoire de l'informatique du parallélisme (LIP, 2008-02)
    (eng) From user’s point of view Grid computing requires an easy, automatic and efficient resource selection as well as application installation and execution. This problem refers to the deployment process. A major lack of ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Bougé, Luc; Namyst, Raymond (2000-05)
    (eng) This paper describes DSM-PM2, a generic, multi-protocol distributed shared memory library built for PM2, a multithreaded runtime system with preemptive thread migration. DSM-PM2 allows threads running on different ...
  • Laboratoire de l'informatique du parallélisme; Dougherty, Daniel; Lang, Frédéric; Lescanne, Pierre; Liquori, Luigi; Rose, Kristoffer (1999-12)
    (eng) In a previous paper we have outlined a framework (or a generic object-calculus) called \Obja, for modeling \textit{object calculi}. In this one, we would like to describe the foundations of \Obja{}. This framework ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Dail, Holly (2005-02)
    (eng) The Distributed Interactive Engineering Toolbox (DIET) is an Application Service Provider (ASP) platform providing remote execution of computational problems on distributed, heterogeneous resources. Traditional ASP ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Dail, Holly (2004-11)
    (eng) In this article, we address the automatic configuration, launch, and management of a distributed middleware platform for the Grid of type Application Service Provider (ASP) called Distributed Interactive Engineering ...
  • Laboratoire de l'informatique du parallélisme; Chavanon, Frédéric; Latapy, Matthieu; Morvan, Michel; Vuillon, Laurent (2003-09)
    (eng) 2D-gons tilings with parallelograms are the main model used in physics to study quasicrystals, and they are also important in combinatorics for the study of aperiodic structures. In this paper, we study the graph ...
  • Soudan, Sébastien; Primet, Pascale; Laboratoire de l'informatique du parallélisme (LIP, 2006-05)
    (eng) Due to network bandwidth growth, grid computing has been envisionned. As grids are aggregation of computer clusters based on high performance local networks and interconnected by very high speed core networks, ...
  • Laboratoire de l'informatique du parallélisme; Bougé, Luc; Gabarro, Joaquim; Messeguer, Xavier; Schabanel, Nicolas (1998-03)
    (eng) We address the concurrent rebalancing of almost balanced binary search trees (AVL trees). Such a rebalancing may for instance be necessary after successive insertions and deletions of keys. We show that this problem ...
  • Laboratoire de l'informatique du parallélisme; Aumage, Olivier (2002-01)
    (eng) This paper introduces the new version of the Madeleine portable multi-protocol communication library. Madeleine version III now includes full, flexible multi-cluster support associated to a redesigned version of the ...
  • Laboratoire de l'informatique du parallélisme; Boudet, Vincent (2001-02)
    (eng) Scheduling computation tasks on processors is a key issue for high-performance computing. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Desprez, Frédéric; Petit, Franck; Villain, Vincent (2003-01)
    (eng) This paper presents the application of the PIF algorithm to a Network Enabled Server environment. Hierarchical scheduling is applied to improve the scalability of the overall architecture and fault tolerance problems ...
  • Delorme, Marianne; Mazoyer, Jacques; Theyssier, Guillaume; Laboratoire de l'informatique du parallélisme (2005-06)
    (eng) Cellular automata are a formal model of locally interacting systems which is very simple but suitable to study complex systems in general. Many classifications have been proposed in the literature, often relying on ...
  • Jeannerod, Claude-Pierre; Raina, Saurabh-Kumar; Tisserand, Arnaud; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) This paper presents floating-point division algorithms and implementations for embedded VLIW integer processors. On those processors, there is no hardware floating-point unit, for cost reasons. But, for portability ...
  • Laboratoire de l'informatique du parallélisme; Dion, Michèle; Randriamaro, Cyril; Robert, Yves (1995-10)
    (eng) Minimizing communications when mapping affine loop nests onto distributed memory parallel computers has already drawn a lot of attention. This paper focuses on the next step : as it is generally impossible to obtain ...
  • Laboratoire de l'informatique du parallélisme; Amestoy, Patrick R.; Guermouche, Abdou; L'Excellent, Jean-Yves; Pralet, Stéphane (2004-12)
    (eng) In this paper, we consider the problem of designing a dynamic scheduling strategy that takes into account both workload and memory information in the context of the parallel multifrontal factorization. The originality ...
  • Laboratoire de l'informatique du parallélisme; Papazian, Christophe; Rémila, Eric (2002-01)
    (eng) Graph automata were first introduced by P. Rosenstiehl. A. Wu and A. Rosenfeld showed later how a graph automaton can study its own structure, by building a system of signals that explore the underlying graph, giving ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share