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; Guermouche, Abdou; L'Excellent, Jean-Yves; Utard, Gil (2003-02)
    (eng) We are concerned with the memory usage of sparse direct solvers. We particularly focus on the influence of state-of-the-art sparse matrix reordering techniques on the dynamic memory usage of a multifrontal solver, ...
  • Laboratoire de l'informatique du parallélisme; Maimour, Moufida; Pham, Cong-Duc (2003-01)
    (eng) Group communications (multicast) are foreseen to be one of the most critical yet challenging technologies to meet the exponentially growing demands for data distribution in a large variety of applications of the ...
  • Laboratoire de l'informatique du parallélisme; Russell, Robert D. (1998-06)
    (eng) This report describes three application program interfaces to BPFS, a distributed, modular parallel file system designed for use on clusters of workstations. These interfaces are called API0, CLI, and MPI-IO. API0 ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Mazoit, Frédéric; Quinson, Martin (2003-02)
    (eng) This paper presents a tool to automatically discover the network topology. The goal is to evaluate the performance of concurrent transfers (for example to improve collective communications) and not to discover the ...
  • Laboratoire de l'informatique du parallélisme; Fraigniaud, Pierre; Vial, Sandrine (1995-09)
    (eng) Broadcasting and gossiping are known to be NP-hard problems. This paper deals with approximation algorithms for such problems. We consider both round-complexity and step-complexity in the telephone model. After an ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal; Fournier, Hervé (1997-10)
    (eng) We show that proving lower bounds in algebraic models of computation may not be easier than in the standard Turing machine model. For instance, a superpolynomial lower bound on the size of an algebraic circuit solving ...
  • Laboratoire de l'informatique du parallélisme; Beuchat, Jean-Luc; Brisebarre, Nicolas; Detrey, Jérémie; Okamoto, Eiji (2007-03)
    (eng) Since their introduction in constructive cryptographic applications, pairings over (hyper)elliptic curves are at the heart of an ever increasing number of protocols. Software implementations being rather slow, the ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Marchal, Loris; Robert, Yves (2004-04)
    (eng) In this paper, we consider steady-state scheduling techniques for mapping a collection of application graphs onto heterogeneous systems, such as clusters and grids. We advocate the use of steady-state scheduling to ...
  • Jeannerod, Claude-Pierre; Villard, Gilles; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) We present the asymptotically fastest known algorithms for some basic problems on univariate polynomial matrices: rank, nullspace, determinant, generic inverse, reduced form. We show that they essentially can be ...
  • Laboratoire de l'informatique du parallélisme; Delorme, Marianne (1997-08)
    (eng) The purpose of this paper is to give an overview on pebble automata, which can be encountered in different domains, as figures (families) recognition, complexity theory and labyrinths theory . It gives definitions, ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Kaur Chouhan, Pushpinder; Legrand, Arnaud (2003-11)
    (eng) This paper focus on the deployment of grid infrastructures, more specifically Problem Solving Environments (PSE) for numerical applications on the grid. Even if the deployment of such an architecture is forced by ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Quinson, Martin (2003-09)
    (eng) The monitoring infrastructure constitutes a key component of any Grid middleware. The Network Weather Service (NWS) is the most commonly used tool to fulfill this need. Unfortunately, users have to deploy the NWS ...
  • Caron, Eddy; Kaur Chouhan, Pushpinder; Dail, Holly; Laboratoire de l'informatique du parallélisme (2005-05)
    (eng) The use of many distributed, heterogeneous resources as a large collective resource offers great potential and has become an increasingly popular idea. A key issue for these Grid platforms is middleware scalability ...
  • Caron, Eddy; Kaur Chouhan, Pushpinder; Desprez, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    (ENG) The use of many distributed, heterogeneous resources as a large collective platform offers great potential. A key issue for these grid platforms is middleware scalability and how middleware services can be mapped ...
  • Laboratoire de l'informatique du parallélisme; Mounier, V.; Utard, Gil (1993)
    (eng) We give a Hoare-like proof system for the data-parallel language L, and we present an automatic tool to aid program correctness proof. After recalling L's operational semantics, we define an axiomatic semantics. We ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Carter, Larry; Ferrante, Jeanne; Legrand, Arnaud; Robert, Yves (2001-06)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogenerous "grid" computing platform. Such problems arise in collaborative computing efforts like SETI@home. ...
  • Quirin Lauter, Christoph; Laboratoire de l'informatique du parallélisme (2005-09)
    (eng) The implementation of correctly rounded elementary functions needs high intermediate accuracy before final rounding. This accuracy can be provided by (pseudo-) expansions of size three, i.e. a triple-double format. ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire (1995-09)
    (eng) Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire; Rabani, Yuval; Sinclair, Alistair (1995-09)
    (eng) We study of the average case performance of the Best Fit algorithm for on-line bin packing under the distribution in which the item sizes are uniformly distributed in the discrete range{1/k,2/k,...,j/k}. Our main ...
  • Benoit, Anne; Kosch, Harald; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-01)
    (eng) Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput and ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share