mirage

Browsing by Title

DSpace/Manakin Repository

Browsing by Title

Sort by: Order: Results:

  • 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 ...
  • De Mesnard, Louis; CNRS, Laboratoire d'analyse et de techniques économiques, Dijon, FRA; Université de Dijon, Laboratoire d'analyse et de techniques économiques, Dijon, FRA (2001)
  • Laboratoire de l'informatique du parallélisme; Muller, Jean-Michel (2005-02)
    (eng) Function ulp (acronym for unit in the last place) is frequently used for expressing errors in floating-point computations. We present several previously suggested definitions of that function, and analyse some of ...
  • Behrens, Kristian; CNRS. Laboratoire d'analyse et de techniques économiques, Dijon, FRA; Université de Dijon. Laboratoire d'analyse et de techniques économiques, Dijon, FRA (2001)
    Dans ce papier nous étendons le modèle de base décrivant la formation d'agglomérations urbaines dans un contexte pré-industriel. Comme nous le montrerons, ce cadre est suffisamment flexible afin de permettre d'explorer de ...
  • Behrens, Kristian; CNRS. Laboratoire d'analyse et de techniques économiques, Dijon, FRA; Université de Dijon. Laboratoire d'analyse et de techniques économiques, Dijon, FRA (2001)
    Dans ce papier nous développons un simple modèle d'économie spatial décrivant la formation d'agglomérations urbaines dans un contexte pré-industriel. Dans un premier temps, au niveau local, l'agglomération rurale résulte ...
  • Laboratoire de l'informatique du parallélisme; Lefevre, Vincent; Muller, Jean-Michel (2000-11)
    (eng) In several cases, the input argument of an elementary function evaluation is given bit-serially, most significant bit first. We suggest a solution for performing the first step of the evaluation (namely, the range ...
  • Institut de mathématiques économiques; Chevaillier, Margaret (trad.); Ponsard, Claude (IME, 1978-04)
    Faced with a set of needs of different intensities and which he perceives more or less indistinctly, a consumer is not normally capable of selecting among the elements belonging to his set of possible consumptions, those ...
  • Laboratoire de l'informatique du parallélisme; Guermouche, Abdou; L'Excellent, Jean-Yves; Utard, Gil (2002-11)
    (eng) We are interested in the memory usage of sparse direct solvers. We particularly focus on the parallel multifrontal scheme. In the multifrontal approach two kinds of memory can be distinguished: a static one which ...
  • Laboratoire de l'informatique du parallélisme; Bournez, Olivier; Branicky, Michael (1999-03)
    (eng) In this paper, we discuss the existence of an algorithm to decide if a given set of 2 \times 2 matrices is mortal: a set F=\{A_1,\dots,A_m\} of 2 \times 2 matrices is said to be \motnouv{mortal} if there exist an ...
  • Centre national de la recherche scientifique, Institut de mathématiques économiques; Serck-Hanssen, Jan (IME, 1981-05)
    One of the advantages of larger towns with a diversified industrial structure compared to smaller towns with less diversified industries, is that larger towns may utilize more efficiently production factors which are ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Vivien, Frédéric (1996-02)
    (eng) We explore the link between dependence abstractions and maximal parallelism extraction in nested loops. Our goal is to find, for each dependence abstraction, the minimal transformations needed for maximal parallelism ...
  • Koiran, Pascal; Nesme, Vincent; Portier, Natacha; Laboratoire de l'informatique du parallélisme (LIP, 2006-08-30)
    (eng) We obtain optimal lower bounds on the nonadaptive probabilistic query complexity of a class of problems defined by a rather weak symmetry condition. In fact, for each problem in this class, given a number T of queries ...
  • Laboratoire de l'informatique du parallélisme; Mazenc, Christophe (1993-05-18)
    (eng) In this paper, a set of definitions describing general real number representation systems is presented. Our purpose is to find a sufficiently wide model definition including classical systems (signed-digit notation,linear ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (1992-12-21)
    (eng) We study the computational capabilities of dynamical systems defined by iterated functions on [0,1]^n. The computations are performed with infinite precision on arbitrary real numbers, like in the model of analog ...
  • Laboratoire de l'informatique du parallélisme; Calland, Pierre-Yves; Darte, Alain; Robert, Yves; Vivien, Frédéric (1996-02)
    (eng) In this paper we build upon results of Padua and Wolfe, who introduce two graph transformations to eliminate anti and output dependences. We first give a unified framework for such transformations. Then, given a loop ...
Bookmark and Share