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; 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 ...
  • Laboratoire de l'informatique du parallélisme; Eberhardt, Regina; Paugam-Moisy, Helene; Puzenat, Didier; Royet, Jean-Pierre (1995-11)
    (eng) Several experiments have been performed in order to study the cognitive processes which are involved in odor recognition. The current report summarizes experimental protocol and analyzes collected data. The goal is ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-07)
    To schedule precedence task graphs in a more realistic framework, we introduce an efficient fault tolerant scheduling algorithm that is both contention-aware and capable of supporting " arbitrary fail-silent (failstop)...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Boudet, Vincent; Robert, Yves (2001-05)
    (eng) Scheduling computational 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; Durand-Lose, Jérôme (2002-11)
    (eng) In this paper, we consider timed automata for piecewise constant signals.In the model presented here, time elapses only during transitions; any constraint on clocks should be satisfied during all the duration of the ...
  • Laboratoire de l'informatique du parallélisme; Baron, Richard (1994-05-27)
    (eng) Artificial neural networks may learn to solve arbitrary complex problems. But knowledge acquired is hard to exhibit. Thus neural networks appear as ``black boxes'', the decisions of which can't be explained. In this ...
  • Laboratoire de l'informatique du parallélisme; Van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre (2005-03)
    (eng) X is an untyped language for describing circuits by composition of basic components. This language is well suited to describe structures which we call "circuits" and which are made of parts that are connected by ...
  • Bertis, Viktors; Bolze, Raphaël; Desprez, Frédéric; Reed, Kevin; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) Scheduling problems are already difficult on traditional parallel machines. They become extremely challenging on heterogeneous clusters, even when embarrassingly parallel applications are considered. In this paper ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Schreiber, Rob; Villard, Gilles (2004-04)
    (eng) We investigate the technique of storing multiple array elements in the same memory cell, with the goal of reducing the amount of memory used by an array variable. This reduction is both important and achievable during ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share