mirage

Browsing Automatique, recherche opérationnelle / Control theory, operational research by Title

DSpace/Manakin Repository

Browsing Automatique, recherche opérationnelle / Control theory, operational research by Title

Sort by: Order: Results:

  • Laboratoire de l'informatique du parallélisme; Delorme, Marianne (1997-08)
    (eng) The purpose of this paper is to give an overview on pebble automata, which can be encountered in different domains, as figures (families) recognition, complexity theory and labyrinths theory . It gives definitions, ...
  • Laboratoire de l'informatique du parallélisme; Jarry, Aubin; Casanova, Henri; Berman, Francine (2000-12)
    (eng) Scheduling the tasks of a distributed application has been an active field of research for several decades. The classic scheduling problem is to find a assignment of application tasks onto a set of distributed resources ...
  • LAMY P.; Institut National de Recherche et de Sécurité pour la prévention des accidents du travail et des maladies professionnelles (INRS, 2004)
    L'utilisation des automates programmables dédiés à la sécurité pour la gestion des fonctions de sécurité des systèmes de commande de machine pose le problème du développement du logiciel applicatif. Un travail de sensibilisation ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Bougé, Luc (2000-11)
    (eng) DSM-PM2 is a platform for designing, implementing and experimenting multithreaded DSM consistency protocols. It provides a generic toolbox which facilitates protocol design and allows for easy experimentation with ...
  • Laboratoire de l'informatique du parallélisme; Dail, Holly; Desprez, Frédéric (2005-02)
    (eng) DIET (Distributed Interactive Engineering Toolbox) is a toolbox for the construction of Network Enabled Server systems. Client requests for computational services are automatically matched with available resources ...
  • Laboratoire de l'informatique du parallélisme; Fatès, Nazim; Morvan, Michel; Schabanel, Nicolas; Thierry, Eric (2005-02)
    (eng) In this paper we propose a probabilistic analysis of the fully asynchronous behavior (i.e., two cells are never simultaneously updated, as in a continuous time process) of elementary finite cellular automata (i.e., ...
  • Laboratoire de l'informatique du parallélisme; Daumas, Marc; Matula, David W. (2000-03)
    (eng) Redundant notations are used implicitly or explicitly in many digital designs. They have been studied in details and a general framework is known to reduce the redundancy of a notation down to the minimally redundant ...
  • Laboratoire de l'informatique du parallélisme; Antoniu, Gabriel; Bougé, Luc; Namyst, Raymond (2000-05)
    (eng) This paper describes DSM-PM2, a generic, multi-protocol distributed shared memory library built for PM2, a multithreaded runtime system with preemptive thread migration. DSM-PM2 allows threads running on different ...
  • DEI-SVALDI D.; KNEPPERT M.; Institut National de Recherche et de Sécurité pour la prévention des accidents du travail et des maladies professionnelles (INRS, 2002)
    La création ou la rénovation d'unité de fabrication automatisée conduit l'utilisateur à initier une réflexion quant au choix technico-économique à opérer pour développer son application. C'est dans ce cadre qu'il est ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Dail, Holly (2005-02)
    (eng) The Distributed Interactive Engineering Toolbox (DIET) is an Application Service Provider (ASP) platform providing remote execution of computational problems on distributed, heterogeneous resources. Traditional ASP ...
  • Laboratoire de l'informatique du parallélisme; Mazoyer, Jacques; Rapaport, Ivan (1997-09)
    (eng) A grouped instance of a cellular automaton (CA) is another one obtained by grouping several states into blocks and by letting interact neighbor blocks. Based on this operation (and on the subautomaton notion), a ...
  • Laboratoire de l'informatique du parallélisme; Van Bakel, Steffen; Lengrand, Stéphane; Lescanne, Pierre (2005-03)
    (eng) X is an untyped language for describing circuits by composition of basic components. This language is well suited to describe structures which we call "circuits" and which are made of parts that are connected by ...
  • Laboratoire de l'informatique du parallélisme; Mignot, Jean-Christophe (2000-12)
    (eng) This paper presents a survey of the state-of-the-art techniques and prototypes for compressing videos. A particular interest is devoted to compression for streaming over the Internet. The basic principles are presented, ...
  • Laboratoire de l'informatique du parallélisme; Danjean, Vincent (2000-03)
    (eng) In this paper, we present LinuxActivation, an efficient system support for user level thread scheduling implemented within Linux. This work is an extension to the ``Scheduler Activations'' model (proposed by Anderson ...
  • Laboratoire de l'informatique du parallélisme; Darte, Alain; Huard, Guillaume (2000-05)
    (eng) The automatic detection of parallel loops is a well-known problem. Sophisticated polynomial algorithms have been proposed to produce code transformations that reveal parallel loops, in an optimal way as long as the ...
  • 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, ...
  • Camanini, Julien; Centre d'études sur les réseaux, les transports, l'urbanisme et les constructions publiques (CERTU, 2008-03)
    Les voies pour véhicules à taux d'occupation élevé (HOV) sont en exploitation depuis la fin des années 60 dans le monde et connaissent de nos jours un intérêt grandissant. En effet, elles permettent un gain en temps pour ...
  • Laboratoire de l'informatique du parallélisme; Aumage, Olivier; Mercier, Guillaume; Namyst, Raymond (2000-10)
    (eng) This report introduces a version of MPICH handling efficiently different networks simultaneously. The core of the implementation relies on a device called ch_mad which is based on a generic multiprotocol communication ...
  • Laboratoire de l'informatique du parallélisme; Beuchat, Jean-Luc; Muller, Jean-Michel (2005-02)
    (eng) The RN-codings are particular cases of signed-digit representations, for which rounding to the nearest is always identical to truncation. In radix $2$, Booth recoding is an RN-coding. In this paper, we suggest several ...
  • 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 ...

Search DSpace


Advanced Search

Browse

My Account

Bookmark and Share