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 :

  • Caniou, Yves; Caron, Eddy; Charrier, Ghislain; Chis, Andrea; Desprez, Frédéric; Maisonnave, Eric; Laboratoire de l'informatique du parallélisme (LIP, 2008-07)
    (eng) In this report, we tackle the problem of scheduling an Ocean-Atmosphere application used for climate prediction on the grid. An experiment is composed of several 1D-meshes of identical DAGs composed of parallel ...
  • Pineau, Jean-François; Robert, Yves; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (2005-07)
    'eng) In this work, we deal with the problem of scheduling independent tasks on heterogeneous master-slave platforms. We target both off-line and on-line problems, with several objective functions (makespan, maximum response ...
  • 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; Nouvel, Bertrand; Remila, Eric (2003-06)
    (eng) We consider a non numerable family of colorations induced by discrete rotations. The symbolical dynamical system associated with the coloration is first explained. We introduce then a group that supports the dynamics ...
  • Laboratoire de l'informatique du parallélisme; Formenti, Enrico; Kurka, Petr (1998-01)
    (eng) We prove that the topological space szd, proposed in is path-connected and has infinite dimension. The latter property makes of this space a more natural setting for cellular automata when they are considered as a ...
  • Laboratoire de l'informatique du parallélisme; Bodini, Olivier; Rémila, Eric (2002-05)
    (eng) This paper studies the tricolorations of edges of triangulations of simply connected orientable surfaces such that the degree of each interior vertex is even. Using previous results on lozenge tilings, we give a ...
  • Laboratoire de l'informatique du parallélisme; Boudet, Vincent; Desprez, Frédéric; Suter, Frédéric (2002-10)
    (eng) In this paper we propose an original algorithm for mixed data and task parallel scheduling. The main specificities of this algorithm are to simultaneously perform the allocation and scheduling processes, and avoid ...
  • Laboratoire de l'informatique du parallélisme; Remila, Eric (1999-11)
    (eng) In this paper, we study domino tilings of polygons. We are especially interested in what happens when the domino prototiles become smaller and smaller. This study is done using tiling height functions, which are a ...
  • Laboratoire de l'informatique du parallélisme; Habib, Michel; Kelly, David; Lebhar, Emmanuelle; Paul, Christophe (2003-04)
    (eng) A graph $G_s=(V,E_s)$ is a sandwich for a pair of graph $G_t=(V,E_t)$ and $G=(V,E)$ if $E_t\subseteq E_s\subseteq E$. Any poset, or partially ordered set, admits a unique graph representation which is directed and ...
  • Laboratoire de l'informatique du parallélisme; Lafitte, Grégory (2001-09)
    (eng) In this paper, we investigate refined definitions of random sequences. Classical definitions have always the shortcome of making use of the notion of algorithm. We discuss the nature of randomness and different ways ...
  • Laboratoire de l'informatique du parallélisme; Lang, Frédéric; Lescanne, Pierre (1999-08)
    (eng) In this paper, we present an attempt to build a calculus of explicit substitution expected to be confluent on open terms, to preserve strong normalisation and to simulate one step `b-reduction. We show why our attempt ...
  • Laboratoire de l'informatique du parallélisme; Perez, Christian; Namyst, Raymond (1997-07)
    (eng) This paper focuses on the use of distributed memory multithreaded environments in data parallel programs and has two main goals. The first is to show that data parallel programs can support features like communication ...
  • Laboratoire de l'informatique du parallélisme; Kaltofen, Erich; Villard, Gilles (2003-07)
    (eng) By combining Kaltofen's 1992 baby steps/giant steps technique for Wiedemann's 1986 determinant algorithm with Coppersmith's 1994 projections by a block of vectors in the Wiedemann approach and Villard's 1997 analysis ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain (1998-10)
    (eng) Loop fusion is a program transformation that combines several loops into one. It is used in parallelizing compilers mainly for increasing the granularity of loops and for improving data reuse. The goal of this report ...
  • Benoit, Anne; Robert, Yves; Thierry, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-10)
    In this paper, we explore the problem of mapping simple application patterns onto large-scale heterogeneous platforms. An important optimization criteria that should be considered in such a framework is the latency, or ...
  • Laboratoire de l'informatique du parallélisme; Giorgi, Pascal; Jeannerod, Claude-Pierre; Villard, Gilles (2003-01)
    (eng) We study the link between the complexity of polynomial matrix multiplication and the complexity of solving other basic linear algebra problems on polynomial matrices. By polynomial matrices we mean n x n matrices of ...
  • Bouchez, Florent; Darte, Alain; Rastello, Fabrice; Laboratoire de l'informatique du parallélisme (LIP, 2006-04)
    (eng) Due to the increasing latencies of memory accesses and recent developments on the SSA form, it has become important to revisit the spilling (load/store insertion) and register coalescing (removal of move instructions) ...
  • Laboratoire de l'informatique du parallélisme; Bournez, Olivier; Cosnard, Michel (1995-10)
    (eng) We explore the simulation and computational capabilities of dynamical systems. We first introduce and compare several notions of simulation between discrete systems. We give a general framework that allows dynamical ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share