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 :

  • Benoit, Anne; Dufossé, Fanny; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    (ENG) In this paper, we explore the problem of mapping filtering web services on large- scale heterogeneous platforms. Two important optimization criteria should be considered in such a framework. The period, which is the ...
  • Agrawal, Kunal; Benoit, Anne; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    This paper presents theoretical results related to mapping and scheduling linear work ows onto heterogeneous platforms. We use a realistic architectural model with bounded communication capabilities and full computatio...
  • Benoit, Anne; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous –nowadays a standard assumption. A high-level approach to parallel programming ...
  • Laboratoire de l'informatique du parallélisme; Benoit, Anne; Robert, Yves (2007-01)
    (eng) Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous --nowadays a standard assumption. A high-level approach to parallel programming ...
  • Laboratoire de l'informatique du parallélisme; Prost, Frederic (1995-12)
    (eng) Constructive logic can be used to consider program specifications as logical formulas. The advantage of this approach is to generate programs which are certified with respect to some given specifications. The programs ...
  • Gaujal, Bruno; Thierry, Eric; Laboratoire de l'informatique du parallélisme (2005-05)
    (eng) In this paper we investigate the asymptotic behavior of a discrete and probabilistic dynamical system which can be described as a growth model where autonomous agents aggregates. The aim of this paper is to give a ...
  • 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; Gegout, Cedric; Girau, Bernard; Rossi, Fabrice (1995-09)
    (eng) We present a general model for differentiable feed-forward neural networks. Its general mathematical description includes the standard multi-layer perceptron as well as its common derivatives. These standard structures ...
  • 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; Saunders, David; Storjohann, Arne; Villard, Gilles (2001-08)
    (eng) Randomized algorithms are given for computing the rank of a matrix over a field of characteristic zero. The matrix is treated as a black box. Only the capability to compute matrix x column-vector and row-vector x ...
  • Laboratoire de l'informatique du parallélisme; Lescanne, Pierre (2004-05)
    (eng) I present a mechanization of epistemic logic, also called knowledge logic, I have done using Coq. This work includes a formalization in Coq of epistemic logic and two case studies. This report is an updating of LIP ...
  • Laboratoire de l'informatique du parallélisme; Guermouche, Abdou; L'Excellent, Jean-Yves (2004-04)
    (eng) The memory usage of sparse direct solvers can be the bottleneck to solve large-scale problems. This paper describes dynamic scheduling strategies that aim at reducing the memory usage of a parallel direct solver. ...
  • 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, ...
  • Laboratoire de l'informatique du parallélisme; Collard, Jean-Francois; Feautrier, Paul (1994-12-21)
    (eng) Static scheduling consists in compile-time mapping of operations to logical execution dates. However, scheduling so far only applies to static control programs, i.e. roughly to nests of do (or for) loops. To extend ...
  • Laboratoire de l'informatique du parallélisme; Vivien, Frédéric; Wicker, Nicolas (2002-12)
    (eng) We investigate the problem of finding a minimal volume parallelepiped enclosing a given set of n three-dimensional points. We give two mathematical properties of these parallelepipeds, from which we derive two ...
  • 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; Lafitte, Grégory; Mazoyer, Jacques (1997-09)
    (eng) Model theory has lately become a domain of interest to computer scientists. The reason is that model theory, and in particular its restriction to finite models, has led to some new results in computational complexity ...
  • Laboratoire de l'informatique du parallélisme; Courant, Judicael (1996-10)
    (eng) The module system of SML is a small typed language of its own. As is, one would expect a proof of its soundness following from a proof of subject reduction, but none exists. As a consequence the theoretical study of ...
  • Laboratoire de l'informatique du parallélisme; Courant, Judicael (1996-10)
    (eng) Several proof-assistants rely on the very formal basis of Pure Type Systems. However, some practical issues raised by the development of large proofs lead to add other features to actual implementations for handling ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share