mirage

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Legrand, Arnaud"

Système d'archivage DSpace/Manakin

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Legrand, Arnaud"

Tri par : Ordre : Résultats :

  • 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; 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 ...
  • 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 ...
  • 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. ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Marchal, Loris; Robert, Yves (2004-02)
    (eng) In this paper, we consider the communications involved by the execution of a complex application deployed on a heterogeneous platform. Such applications extensively use macro-communication schemes, for example to ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2001-04)
    (eng) In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors are heterogeneous ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Rastello, Fabrice; Robert, Yves (2000-12)
    (eng) In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large kernel, which requires ...
  • Laboratoire de l'informatique du parallélisme; Eyraud-Dubois, Lionel; Legrand, Arnaud; Quinson, Martin; Vivien, Frédéric (2007-02)
    (eng) To fully harness Grids, users or middlewares must have some knowledge on the topology of the platform interconnection network. As such knowledge is usually not available, one must uses tools which automatically build ...
  • 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; Legrand, Arnaud; Renard, Hélène; Robert, Yves; Vivien, Frédéric (2003-04)
    (eng) This paper is devoted to mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2001-03)
    (eng) In this paper, we revisit the master-slave tasking paradigm in the context of heterogeneous processors. We assume that communications take place in exclusive mode. We present a polynomial algorithm that gives the ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Lerouge, Julien (2002-07)
    (eng) Most scheduling problems are already hard on homogeneous platforms, they become quite intractable in an heterogeneous framework such as a metacomputing grid. In the best cases, a guaranteed heuristic can be found, ...
  • Legrand, Arnaud; Su, Alan; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2008-02)
    (eng) In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very few ...
  • Legrand, Arnaud; Su, Alan; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2006-10)
    (eng) In this paper, we consider the problem of scheduling distributed biological sequence comparison applications. This problem lies in the divisible load framework with negligible communication costs. Thus far, very ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Su, Alan; Vivien, Frédéric (2004-11)
    (eng) In this paper, we consider the problem of scheduling comparisons of motifs against biological databanks. We show that this problem lies in the divisible load framework. In this framework, we propose a polynomial-time ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-10)
    (eng) In this paper, we discuss several algorithms for scheduling divisible loads on heterogeneous systems. Our main contributions are (i) new optimality results for single-round algorithms and (ii) the design of an ...
  • Laboratoire de l'informatique du parallélisme; Legrand, Arnaud; Marchal, Loris; Robert, Yves (2003-06)
    (eng) In this paper, we consider the communications involved by the execution of a complex application, deployed on a heterogeneous ``grid'' platform. Such applications intensively use collective macro-communication schemes, ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-02)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous processor farm. The master processor and the p slaves have different computation and communication ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Casanova, Henri; Legrand, Arnaud; Robert, Yves; Yang Yang (2003-09)
    (eng) Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in master-worker ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share