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; Brisebarre, Nicolas; Philibert, Georges (2003-11)
    (eng) Using an elementary approach based on careful handlings of Cauchy integrals, we give precise effective lower and upper bounds for the Fourier coefficients of powers of the modular invariant
  • Caron, Eddy; Desprez, Frédéric; Tedeschi, Cédric; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    (ENG) The efficiency of service discovery is a crucial point in the development of fully decentralized middlewares intended to manage large scale computational grids. The work conducted on this issue led to the design ...
  • Laboratoire de l'informatique du parallélisme; Hirschkoff, Daniel; Pous, Damien; Sangiorgi, Davide (2004-12)
    (eng) Safe Ambients (SA) are a variant of the Ambient Calculus (AC) in which types can be used to avoid certain forms of interferences among processes called
  • Laboratoire de l'informatique du parallélisme; Chaussumier, Frédérique; Desprez, Frédéric; Loi, Michel (1999-05)
    (eng) In the medical field, volume rendering provides good quality 3D visualizations but is still not enough interactive for a day-to-day practice. The most efficient sequential algorithm is the shear-warp algorithm. It ...
  • Laboratoire de l'informatique du parallélisme; Chen, L.; Eberly, W.; Kaltofen, Erich; Saunders, B.D.; Turner, W.J.; Villard, Gilles (2001-01)
    (eng) The main idea of the ``black box'' approach in exact linear algebra is to reduce matrix problems to the computation of minimum polynomials. In most cases preconditioning is necessary to obtain the desired result. ...
  • Laboratoire de l'informatique du parallélisme; Goglin, Brice; Glück, Olivier; Vicat-Blanc Primet, Pascale (2005-04)
    (eng) Running parallel applications on clusters with high-speed local networks requires fast communication between computing nodes but also low latency and high bandwidth file access. However, the application programming ...
  • Laboratoire de l'informatique du parallélisme; Chavarría-Miranda, Daniel; Darte, Alain; Fowler, Robert; Mellor-Crummey, John (2001-11)
    (eng) Multipartitioning is a strategy for partitioning multi-dimensional arrays on a collection of processors. With multipartitioning, computations that require solving 1D recurrences along each dimension of a multi-dimensional ...
  • Feautrier, Paul; Laboratoire de l'informatique du parallélisme (LIP, 2007-05)
    (eng) Array-OL is a high-level specification language dedicated to the definition of intensive signal processing applications. Several tools exist for implementing an Array-OL specification as a data parallel program. While ...
  • Laboratoire de l'informatique du parallélisme; Koiran, Pascal (1998-03)
    (eng) Blum, Cucker, Shub and Smale have shown that the problem ``$\p = \np$~?'' has the same answer in all algebraically closed fields of characteristic~0. We generalize this result to the polynomial hierarchy: if it ...
  • Fournel, Nicolas; Fraboulet, Antoine; Feautrier, Paul; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) This research report presents a non intrusive methodology for building embedded systems energy consumption models. The method is based on measurement on real hardware in order to get a quantitative approach that ...
  • Laboratoire de l'informatique du parallélisme; Vicat-Blanc, Pascale; Glück, Olivier; Otal, Cyril; Echantillac, François (2004-12)
    (eng) The Grid aims at expanding the cluster based parallel computing paradigm toward large scale distributed systems based on IP networks. To validate grid algorithms, evaluate their performance and to study transport and ...
  • Soudan, Sébastien; Guillier, Romaric; Primet, Pascale; Laboratoire de l'informatique du parallélisme (LIP, 2007-05)
    (eng) In Grids, transfer jobs and network resources need to be managed in a more deterministic way than in the Internet. New approaches like flow scheduling are proposed and studied as alternatives to traditional QoS and ...
  • Pineau, Jean-François; Robert, Yves; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2008-10)
    (ENG) In this report, we consider the problem of scheduling an application composed of independent tasks on a fully heterogeneous master-worker platform with communication costs. We introduce a bi-criteria approach aiming ...
  • Laboratoire de l'informatique du parallélisme; Lescanne, Pierre (2001-03)
    (eng) We present an experiment on epistemic logic, also called knowledge logic, we have done using COQ. This work involves a formalization in COQ of the epistemic logic which has been checked for adequacy on two puzzles ...
  • Laboratoire de l'informatique du parallélisme; Gaidioz, Benjamin; Primet, Pascale (2002-02)
    (eng) It is now quite agreed that the IP layer should provide more sophisticated services than the simple best-effort service to meet the application's quality of service requirements. Different proposals for improving the ...
  • 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; 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; Michard, Romain; Tisserand, Arnaud (2004-12)
    (eng) This work deals with FPGA arithmetic operators, based on shift-and-add algorithm, for polynomial and rational approximation of functions. These operators are high-radix iterations of the E-method proposed by M. ...
  • Primet, Pascale; Mornard, Olivier; Gelas, Jean-Patrick; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) Virtualization technics of the Operating System improve security, isolation, reliability and flexibility of the environments. These technics become a must in large scale distributed system and begin to be used in ...
  • Guillier, Romaric; Hablot, Ludovic; Primet, Pascale; Soudan, Sébastien; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) This report outline an evaluation of Ethernet links in Grid'5000, a French research grid built with 3000 processors on 9 sites. These sites are connected with dedicated 1 GbE or 10 GbE links. Efficient TCP parameters ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share