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; Bonhomme, Alice (2001-05)
    (eng) This article studies the design and the performance of a fault-tolerant distributed storage system dedicated to video. We use a completely distributed approach that permit to reduce the memory cost of the reliability ...
  • Laboratoire de l'informatique du parallélisme; Feautrier, Paul (2004-04)
    (eng) Scheduling a program (i.e. constructing a timetable for the execution of its operations) is one of the most powerful methods for automatic parallelization. A schedule gives a blueprint for constructing a synchronous ...
  • Marchal, Loris; Rehn, Veronika; Robert, Yves; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2006-06)
    (eng) In this work we are interested in the problem of scheduling and redistributing data on master-slave platforms. We consider the case were the workers possess initial loads, some of which having to be redistributed ...
  • Gallet, Matthieu; Robert, Yves; Vivien, Frédéric; Laboratoire de l'informatique du parallélisme (LIP, 2006-06)
    (eng) In this paper, we study the problem of scheduling file transfers through a switch. This problem is at the heart of a model often used for large grid computations, where the switch represents the core of the network ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Casanova, Henri; Legrand, Arnaud; Robert, Yves; Yang Yang (2003-09)
    (eng) Applications in many scientific and engineering domains are structured in large numbers of independent tasks with low granularity. These applications can thus be naturally parallelized, typically in master-worker ...
  • Beaumont, Olivier; Marchal, Loris; Robert, Yves; Laboratoire de l'informatique du parallélisme (2005-05)
    (eng) In this paper, we consider the problem of scheduling independent tasks, or divisible loads, onto an heterogeneous star platform, with both heterogeneous computing and communication resources. We consider the case ...
  • Marchal, Loris; Robert, Yves; Vicat-Blanc Primet, Pascale; Zeng, Jingdi; Laboratoire de l'informatique du parallélisme (2005-07)
    (eng) We consider the problem of bulk data transfers and bandwidth sharing in the context of grid infrastructures. Grid computing empowers high-performance computing in a large-scale distributed environment. Network ...
  • Laboratoire de l'informatique du parallélisme; Banino, Cyril; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-03)
    (eng) In this paper, we consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous "grid" computing platform. We use a non-oriented graph to model a grid, where resources can ...
  • Laboratoire de l'informatique du parallélisme; Beaumont, Olivier; Legrand, Arnaud; Robert, Yves (2002-05)
    (eng) In this paper, we consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent problems to be solved. In turn, ...
  • Laboratoire de l'informatique du parallélisme; Giersch, Arnaud; Robert, Yves; Vivien, Frédéric (2003-10)
    (eng) This paper is devoted to scheduling a large collection of independent tasks onto a large distributed heterogeneous platform, which is composed of a set of servers. Each server is a processor cluster equipped with a ...
  • Laboratoire de l'informatique du parallélisme; Giersch, Arnaud; Robert, Yves; Vivien, Frédéric (2004-02)
    (eng) This paper is devoted to scheduling a large collection of independent tasks onto a large distributed heterogeneous platform, which is composed of a set of servers. Each server is a processor cluster equipped with a ...
  • Laboratoire de l'informatique du parallélisme; Giersch, Arnaud; Robert, Yves; Vivien, Frédéric (2003-05)
    (eng) This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master processor. A given file may well be ...
  • Fèvre, Aurélia; L'Excellent, Jean-Yves; Pralet, Stéphane; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) This document describes the Scilab and MATLAB interfaces to MUMPS version 4.6. We describe the differences and similarities between usual Fortran/C MUMPS interfaces and its Scilab/MATLAB interfaces, the calling ...
  • Laboratoire de l'informatique du parallélisme; Lebhar, Emmanuelle; Schabanel, Nicolas (2003-11)
    (eng) Since Milgram experiment in 1967, that demonstrated the ability of people to find short paths efficiently in networks, based only on their own local view of the network, different models have been proposed to study ...
  • Laboratoire de l'informatique du parallélisme; Detrey, Jérémie; de Dinechin, Florent (2004-03)
    (eng) This paper presents a new scheme for the hardware evaluation of elementary functions, based on a piecewise second order minimax approximation. The novelty is that this evaluation requires only one small rectangular ...
  • Laboratoire de l'informatique du parallélisme; Rapaport, Ivan; Rémila, Eric (2004-09)
    (eng) Squares are the most studied shapes in the tile assembly model. Adleman et al. proved that the program size complexity of an $n \times n$ square is $\Theta(\frac{\log n}{\log\log n})$. In other words, for each $n$ ...
  • Caron, E.; Datta, A.K.; Depardon, B.; Larmore, L.L.; Laboratoire de l'informatique du parallélisme (LIP, 2008-09)
    (ENG) A self-stabilizing asynchronous distributed algorithm is given for constructing a k-dominating set, and hence a k-clustering, of a connected network of processes with unique IDs and weighted edges. The algorithm is ...
  • Laboratoire de l'informatique du parallélisme; Hirschkoff, Daniel; Lozes, E.; Sangiorgi, D. (2002-05)
    (eng) The
  • Poupet, Victor; Laboratoire de l'informatique du parallélisme (LIP, 2006-02)
    (eng) In this article we will focus on a famous open question about algorithmic complexity classes on one dimensional cellular automata, and we will show that if all problems recognizable in space n (where n is the length ...
  • Laboratoire de l'informatique du parallélisme; Bonhomme, Alice; Mostefaoui, Ahmed (1999-12)
    (eng) This report presents a survey of techniques used in the conception of a video server. It also includes a survey of prototypes developped in this area. Based on a fonctionnal model of video server, the different ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share