mirage

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Benoit, Anne"

Système d'archivage DSpace/Manakin

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Benoit, Anne"

Tri par : Ordre : Résultats :

  • Benoit, Anne; Kosch, Harald; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-01)
    (eng) Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonistic criteria should be optimized, such as throughput and ...
  • Laboratoire de l'informatique du parallélisme; Benoit, Anne; Robert, Yves (2007-03)
    (eng) Mapping applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline or fork graphs. Several antagonist criteria should be optimized for workflow applications, ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2007-12)
    (eng) Fault tolerance and latency are important requirements in several applications which are time critical in nature: such applications require guaranties in terms of latency, even when processors are subject to ...
  • Benoit, Anne; Laboratoire de l'informatique du parallélisme; Rehn, Veronika; Robert, Yves (LPI, 2006-12)
    (eng) This paper discusses and compares several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-07)
    To schedule precedence task graphs in a more realistic framework, we introduce an efficient fault tolerant scheduling algorithm that is both contention-aware and capable of supporting " arbitrary fail-silent (failstop)...
  • Benoit, Anne; Dufossé, Fanny; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    (ENG) In this paper, we explore the problem of mapping filtering web services on large- scale heterogeneous platforms. Two important optimization criteria should be considered in such a framework. The period, which is the ...
  • Agrawal, Kunal; Benoit, Anne; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    This paper presents theoretical results related to mapping and scheduling linear work ows onto heterogeneous platforms. We use a realistic architectural model with bounded communication capabilities and full computatio...
  • Benoit, Anne; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2006-11)
    (eng) Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous –nowadays a standard assumption. A high-level approach to parallel programming ...
  • Laboratoire de l'informatique du parallélisme; Benoit, Anne; Robert, Yves (2007-01)
    (eng) Mapping applications onto parallel platforms is a challenging problem, that becomes even more difficult when platforms are heterogeneous --nowadays a standard assumption. A high-level approach to parallel programming ...
  • Benoit, Anne; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2007-06)
    (ENG) Mapping workflow applications onto parallel platforms is a challenging problem, even for simple application patterns such as pipeline graphs. Several antagonist criteria should be optimized, such as throughput ...
  • Benoit, Anne; Robert, Yves; Thierry, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-10)
    In this paper, we explore the problem of mapping simple application patterns onto large-scale heterogeneous platforms. An important optimization criteria that should be considered in such a framework is the latency, or ...
  • Benoit, Anne; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-03)
    (eng) Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple application patterns such as pipeline graphs. The problem is even more complex when processors are subject to failure during ...
  • Benoit, Anne; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2007-11)
    (ENG) Mapping applications onto heterogeneous platforms is a difficult challenge, even for simple application patterns such as pipeline graphs. The problem is even more complex when processors are subject to failure during ...
  • Benoit, Anne; Hakem, Mourad; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-02)
    (eng) Abstract Most list scheduling heuristics rely on a simple platform model where communication contention is not taken into account. In addition, it is generally assumed that processors in the systems are completely ...
  • Benoit, Anne; Casanova, Henri; Rehn-Sonigo, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-06)
    In this paper we consider the operator mapping problem for in-network stream processing applications. In-network stream processing consists in applying a tree of operators in steady-state to multiple data objects that are ...
  • Benoit, Anne; Rehn, Veronika; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2006-10)
    (eng) In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity and QoS constraints. The client requests are known beforehand, while the number and location of ...
  • Benoit, Anne; Marchal, Loris; Robert, Yves; Laboratoire de l'informatique du parallélisme (LIP, 2008-10)
    This position paper advocates the need for scheduling. Even if resources at our disposal would become abundant and cheap, not to say unlimited and free (a~perspective that is not granted), we would still need to assign the ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share