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 :

  • 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 ...
  • Laboratoire de l'informatique du parallélisme; Boudet, Vincent; Petitet, Antoine; Rastello, Fabrice; Robert, Yves (1999-06)
    (eng) We study the implementation of dense linear algebra computations, such as matrix multiplication and linear system solvers, on two-dimensional (2D) grids of heterogeneous processors. For these operations, 2D-grids are ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2001-04)
    (eng) In this paper, we study the implementation of dense linear algebra kernels, such as matrix multiplication on 2D grids with homogeneous processors when the communication links between the processors are heterogeneous ...
  • Laboratoire de l'informatique du parallélisme; Schabanel, Nicolas (1999-09)
    (eng) The data-broadcast problem consists in finding an infinite schedule to broadcast a given set of messages so as to minimize the average response time to clients requesting messages, and the cost of the broadcast. This ...
  • Laboratoire de l'informatique du parallélisme; Duprat, Jean; Fiallos-Aguilar, Mario (1992-03-30)
    (eng) In this paper we deal with a new high precision computation of the dot product. The key idea is to use hundreds of digit-serial arithmetic units that allow a massive digit-level pipelining. Parallel discrete-event ...
  • Laboratoire de l'informatique du parallélisme; Renard, Hélène; Robert, Yves; Vivien, Frédéric (2004-05)
    (eng) We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. The problem arises in several applications, each time after that a load-balancing mechanism is invoked (but we do ...
  • Laboratoire de l'informatique du parallélisme; Ferreira, Afonso; Kenyon, Claire; Rau-Chaplin, Andrew; Ubeda, Stephane (1996-08)
    (eng) Given a set $L$ of $n$ points in the $d$-dimensional Cartesian space $E^d$, and a query specifying a domain $q$ in $E^d$, the Range Search problem consists in identifying the subset $R(q)$ of the points of $L$ contained ...
  • Laboratoire de l'informatique du parallélisme; Caron, Eddy; Kaur Chouhan, Pushpinder; Desprez, Frédéric (2004-07)
    (eng) We present algorithms for the scheduling sequential tasks on a Network Enabled Server (NES) environment. We have implemented the non-preemptive scheduling, since at the user level we cannot interrupt a running process ...
  • Laboratoire de l'informatique du parallélisme; Maimour, Moufida; Pham, Cong-Duc (2003-03)
    (eng) Many of the proposed multicast congestion avoidance algorithms are single-rate where heterogeneity is accommodated by adjusting the transmission rate as a response to the worst receiver in the group. Due to the ...
  • Laboratoire de l'informatique du parallélisme; Blondel, Vincent D.; Jeandel, Emmanuel; Koiran, Pascal; Portier, Natacha (2003-04)
    (eng) We study the following decision problem: is the language recognized by a quantum finite automaton empty or non-empty? We prove that this problem is decidable or undecidable depending on whether recognition is defined ...
  • Laboratoire de l'informatique du parallélisme; Blondel, Vincent; Bournez, Olivier; Koiran, Pascal; Papadimitriou, Christos H.; Tsitsiklis, John N. (1999-01)
    (eng) We show that several global properties (attractivity, global asymptotic stability and mortality) of discrete time dynamical systems defined by iteration of piecewise-affine maps are undecidable. Such results had been ...
  • 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 ...
  • Tedeschi, Cédric; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    Dans les grilles des serveurs offrent des services aux clients afin de réaliser des calculs. Avant de pouvoir les utiliser, les clients doivent être à même de les retrouver. Bien que les différentes solutions proposées ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal; Chapuis, Olivier (1998-07)
    (eng) We prove that there exists no sentence F of the language of rings with an extra binary predicat I_2 satisfying the following property: for every definable set X of C^2, X is connected if and only if (C,X) satisfies ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Rastello, Fabrice; Robert, Yves (2000-12)
    (eng) In this paper, we deal with redistribution issues for dense linear algebra kernels on heterogeneous platforms. In this context, processors speeds may well vary during the execution of a large kernel, which requires ...
  • Laboratoire de l'informatique du parallélisme; Audebaud, Philippe; Zucca, Elena (1997-06)
    (eng) We claim that the continuation style semantics of a programming language can provide a starting point for constructing a proof system for that language. The basic idea is to see weakest precondition as a particular ...
  • Coglin, Brice; Prylli, Loïc; Laboratoire de l'informatique du parallélisme (LIP, 2003-09)
    (eng) ORFA is a user-level protocol that aims at providing an efficient remote file system access. It uses high bandwidth local networks and their specific API to directly connect user programs to data in the remote server. ...
  • Laboratoire de l'informatique du parallélisme; Prost, Frederic (1997-05)
    (eng) In this paper we extend, by allowing rank 2 intersection types, the type assignment system for the detection and elimination of dead code in typed functional programs presented by Coppo et al Giannini and the first ...
  • Laboratoire de l'informatique du parallélisme; Desprez, Frédéric; Dongarra, Jack; Rastello, Fabrice; Robert, Yves (1997-10)
    (eng) In the framework of fully permutable loops, tiling has been studied extensively as a source-to-source program transformation. We build upon recent results by H\"ogsted, Carter, and Ferrante~\cite{HogstedtCF97}, who ...
  • Caron, Eddy; Desprez, Frédéric; Laboratoire de l'informatique du parallélisme (2005-06)
    (eng) Among existing grid middleware approaches, one simple, powerful, and flexible approach consists of using servers available in different administrative domains through the classical client-server or Remote Procedure ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share