mirage

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

Système d'archivage DSpace/Manakin

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

Tri par : Ordre : Résultats :

  • 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; 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; Marchal, Loris; Robert, Yves (2004-11)
    (eng) In this paper, we deal with broadcasting on heterogeneous platforms. Typically, the message to be broadcast is split into several slices, which are sent by the source processor in a pipeline fashion. A spanning tree ...
  • 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; 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; 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; 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; Beaumont, Olivier; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (2000-01)
    (eng) In this paper, we address the issue of implementing matrix-matrix multiplication on heterogeneous platforms. We target two different classes of heterogeneous computing resources: heterogeneous networks of workstations, ...
  • 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; Beaumont, Olivier; Boudet, Vincent; Rastello, Fabrice; Robert, Yves (2000-03)
    (eng) In this paper, we deal with two geometric problems arising from heterogeneous parallel computing: how to partition the unit square into p rectangles of given area s_1, s_2,..., s_p (such that the sum of the s_i is ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Marchal, Loris (2004-07)
    (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 (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; Boudet, Vincent; Robert, Yves (2001-09)
    (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; 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 ...
  • Beaumont, Olivier; Marchal, Loris; Robert, Yves; Laboratoire de l'informatique du parallélisme (2005-05)
    (eng) In this paper, we consider the problem of scheduling independent tasks, or divisible loads, onto an heterogeneous star platform, with both heterogeneous computing and communication resources. We consider the case ...
  • Laboratoire de l'informatique du parallélisme; Banino, Cyril; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-03)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid, where resources can ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-05)
    (eng) In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Rastello, Fabrice; Robert, Yves (2000-12)
    (eng) In this paper, we deal with algorithmic issues on heterogeneous platforms. We concentrate on dense linear algebra kernels, such as matrix multiplication or LU decomposition. Block cyclic distribution techniques used ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share