mirage

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Issue Date

DSpace/Manakin Repository

Browsing LIP - Laboratoire de l'Informatique du Parallélisme by Issue Date

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Utard, Gil; Cuvillier, Guy (1994-11-15)
    (eng) We describe the compilation and execution of data-parallel languages for networks of workstations. Executions of distributed programs on cluster of workstations must take into account the loads changing dynamically ...
  • Laboratoire de l'informatique du parallélisme; Roka, Zsuzsanna (1994-12)
    (eng) We consider cellular automata on Cayley graphs and compare their computational powers according to the architecture on which they work. We show that, if there exists a homomorphism with a finite kernel from a group ...
  • Laboratoire de l'informatique du parallélisme; Duboux, Thibault; Ferreira, Afonso (1994-12-21)
    (eng) The fast development over the last years of high performance multicomputers makes them attractive candidates as the base technology for scalable and performance oriented database applications. In this paper, we address ...
  • 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; Hains, Gaetan; Mullins, John (1994-12-27)
    (eng) We apply the theory of generalised concrete data structures (or gCDSs) to construct a cartesian closed category of concrete array structures with explicit data layout. The technical novelty is the array gCDS preserved ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques (1995-01)
    (eng) We study the Firing Squad Synchronization Problem with non uniform delays in the case of a line of cells. The problem was solved in the general case by T.~Jiang in time Delta^3. In the case of the line, we improve ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques (1995-01)
    (eng) In this paper, we are interested in signals, form whereby the data can be transmitted in a cellular automaton. We study generation of some signals. In this aim, we investigate a notion of constructibility of increasing ...
  • Laboratoire de l'informatique du parallélisme; Tougne, Laure (1995-01-31)
    (eng) We consider a family of figures of the discrete plane (rectangles, squares, ellipses,...); how shall we decide with a 2D cellular automaton whether a given figure belongs to the family or not? We essentially give ...
  • Laboratoire de l'informatique du parallélisme; Filliatre, Jean-Christophe (1995-02)
    (eng) The paper of J. Ketonen and R. Weyhrauch [6] defines a decidable fragment of first-order predicate logic - Direct Predicate Calculus - as the subset which is provable in Gentzen sequent calculus without the contraction ...
  • Laboratoire de l'informatique du parallélisme; Bougé, Luc; Cachera, David (1995-03)
    (eng) We present a proof outline generation system for a simple data-parallel kernel language called L. We show that proof outlines are equivalent to the sound and complete Hoare logic defined for L in previous papers. ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Dion, Michèle; Robert, Yves (1995-04)
    (eng) In this paper, we deal with modular mappings as introduced by Lee and Fortes, and we build upon their results. Our main contribution is a characterization of one-to-one modular mappings that is valid even when the ...
  • Laboratoire de l'informatique du parallélisme; Gavoille, Cyril; Guevremont, Eric (1995-04-05)
    (eng) Consider shortest path interval routing, a popular memory-balanced method for solving the routing problem on arbitrary networks. Given a network G, let IRS(G) denote the maximum number of intervals necessary to encode ...
  • Laboratoire de l'informatique du parallélisme; Prylli, Loïc (1995-05)
    (eng) Our work deals with simulation of distributed memory parallel computers. The tool we realized allows to take an application written for say an Intel Paragon and run it on a workstations cluster by just recompiling ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Vivien, Frédéric (1995-05-24)
    (eng) In this paper, we compare three nested loops parallelization algorithms (Allen and Kennedy's algorithm, Wolf and Lam's algorithm and Darte and Vivien's algorithm) that use different representations of distance vectors ...
  • Ubéda, Stéphane; Vigouroux, Xavier; Laboratoire de l'informatique du parallélisme (LIP, 1995-07)
    (eng) This report presents the work done to parallelize a quantization algorithm of color images on a LAN of workstations. The quantization consists in reducing the number of colors in order to reduce the length of an ...
  • Laboratoire de l'informatique du parallélisme; Calland, Pierre-Yves; Mignotte, Anne; Peyran, Olivier; Robert, Yves; Vivien, Frédéric (1995-09)
    (eng) The increasing complexity of digital circuitry makes global design optimization no longer possible: a designer will only consider the critical parts of his circuit. This paper discusses timing optimization problems ...
  • Laboratoire de l'informatique du parallélisme; Kenyon, Claire (1995-09)
    (eng) Best-fit is the best known algorithm for on-line bin-packing, in the sense that no algorithm is known to behave better both in the worst case (when Best-fit has performance ratio 1.7) and in the average uniform case, ...
  • Laboratoire de l'informatique du parallélisme; Karp, Richard M.; Kenyon, Claire; Waarts, Orli (1995-09)
    (eng) The DNA model of computation, with test tubes of DNA molecules encoding bit sequences, is based on three primitives, extract-a-bit, merge-two-tubes and detect-emptiness. Perfect operations can test the satisfiability ...
  • 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; Allauzen, Cyril; Durand, Bruno (1995-09)
    (eng) We study some decision problems concerning the tiling of the plane with Wang tiles. We present a proof for the undecidability of the tiling problem for the whole plane, and also for the periodic tiling. In these ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share