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; 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 ...
  • Laboratoire de l'informatique du parallélisme; Dhoutaut, Dominique (2001-12)
    (eng) For commercial availability reasons, most actual multi-hops ad-hoc simulations and test-beds are based on IEEE 802.11 standard \cite{80211} and its medium access method CSMA/CA. But this standard has not been designed ...
  • Laboratoire de l'informatique du parallélisme; Bertet, Karell; Guérin-Lassous, Isabelle; Viennot, Laurent (2001-04)
    (eng) This paper presents a theoretical study on the bandwidth reservation problem for ad hoc networks. The proposed model is based on the spatial reuse and the existence of interferences. We show that in that case, the ...
  • Benoit, Anne; Laboratoire de l'informatique du parallélisme; Rehn, Veronika; Robert, Yves (LPI, 2006-12)
    (eng) This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of ...
  • Laboratoire de l'informatique du parallélisme; Cozette, Olivier; Randriamaro, Cyril; Utard, Gil (2002-03)
    (eng) Grand challenge applications often need to process large amounts of data so high performance IO systems are needed. Cluster computing is a good approach to build cost effective IO intensive platform: sort benchmark ...
  • Laboratoire de l'informatique du parallélisme; Ercegovac, Milos; Imbert, Laurent; Matula, David; Muller, Jean-Michel; Wei, Guoheng (1999-09)
    (eng) The aim of this paper is to accelerate division, square root and square root reciprocal computations, when Goldschmidt method is used on a pipelined multiplier. This is done by replacing the last iteration by the ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Marchal, Loris; Robert, Yves (2004-04)
    (eng) In this paper, we consider the problem of allocating and scheduling a collection of independent, equal-sized tasks on heterogeneous star-shaped platforms. We also address the same problem for divisible tasks. For ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques; Rapaport, Ivan (1997-09)
    (eng) A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the subautomaton notion), a ...
  • Laboratoire de l'informatique du parallélisme; Lafitte, Grégory; Mazoyer, Jacques (2000-02)
    (eng) We consider the infinite versions of the usual computational complexity questions LogSpace?=P, NLogSpace?=P by studying the comparison of their descriptive logics on infinite partially ordered structures rather than ...
  • Goglin, Brice; Glück, Olivier; Vicat-Blanc Primet, Pascale; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) Parallel applications running on clusters require both highperformance communications between nodes and efficient access to the storage system. We propose to improve the performance of distributed storage systems ...
  • Laboratoire de l'informatique du parallélisme; Dubacq, Jean-Christophe (1998-01)
    (eng) We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic information theory, and underline the main differences between the Kolmogorov complexity and Kolmogorov prefix complexity. ...
  • Soudan, Sébastien; Guillier, Romaric; Hablot, Ludovic; Kodama, Yuetsu; Kudoh, Tomohiro; Okazaki, Fumihiro; Primet, Pascale; Takano, Ryousei; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) This paper examines the interactions between layer 2 (Ethernet) switches and TCP in high bandwidth delay product networks. First, the behavior of a range of Ethernet switches when two long lived connections compete ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share