mirage

Browsing Informatique / Computer science by Issue Date

DSpace/Manakin Repository

Browsing Informatique / Computer science by Issue Date

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Baron, Richard (1994-05-27)
    (eng) Artificial neural networks may learn to solve arbitrary complex problems. But knowledge acquired is hard to exhibit. Thus neural networks appear as ``black boxes'', the decisions of which can't be explained. In this ...
  • Laboratoire de l'informatique du parallélisme; Bougé, Luc; Utard, Gil (1994-06-02)
    (eng) We describe a simple data-parallel kernel language which encapsulates the main data-parallel control structures found in high-level languages such as MasPar's MPL or the recent HyperC. In particular, it includes the ...
  • Laboratoire de l'informatique du parallélisme; Dion, Michèle; Risset, Tanguy; Robert, Yves (1994-06-27)
    (eng) We deal with the problem of partitioning and mapping uniform loop nests onto physical processor arrays. Resource constraints are taken into account: not only we assume a limited number of available processors, but ...
  • Laboratoire de l'informatique du parallélisme; Audebaud, Philippe (1994-09-08)
    (eng) We present a confluent rewriting system wich extends a previous calculus for the Lambda-Calculus (Levy, Hardin) to Parigot's untyped Lambda-Mu-Calculus. This extension embeds the Lambda- Mu-Calculus as a sub-theory, ...
  • Laboratoire de l'informatique du parallélisme; Fraigniaud, Pierre; Laforest, Christian (1994-09-21)
    (eng) Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all the other nodes. A bus network is a network of processing ...
  • Vigouroux, Xavier-François; Laboratoire de l'informatique du parallélisme (LIP, 1994-10)
    (eng) PIMSy (stands for Parallel Implementation of a Monitoring System) is a tool to analyze distributed trace files. For all that, the generating phase, instead of generating one trace file while the program is executed, ...
  • Boulet, Pierre; Dion, Michèle; Lequiniou, Eric; Risset, Tanguy; Laboratoire de l'informatique du parallélisme (LIP, 1994-10)
    (eng) This documents presents the first version of the Bouclettes automatic parallelizer developed at LIP. It gives a detailed description of the functionalities and internal mechanics of the parallelizer, from the graphical ...
  • 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 ...
  • Institut de l'information scientifique et technique; Auroux, Sylvain; Dagand, Gilles; Desfarges, Patrick; Gall, J.; Ferrier, Jean-Pierre; Humbert, Michel; Jeansoulin, Robert; Maignien, Yannick; de Rudder, Véronique; Gourd, Francine; Wolf-Kugel, Dominique (INIST-CNRS, 1995-02)
  • 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 ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share