9 results on '"BENOIT, ANNE"'
Search Results
2. Mapping Pipeline Skeletons onto Heterogeneous Platforms
- Author
-
Benoit, Anne, Robert, Yves, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Shi, Yong, editor, van Albada, Geert Dick, editor, Dongarra, Jack, editor, and Sloot, Peter M. A., editor
- Published
- 2007
- Full Text
- View/download PDF
3. Impact of QoS on Replica Placement in Tree Networks
- Author
-
Benoit, Anne, Rehn, Veronika, Robert, Yves, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Rangan, C. Pandu, editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Shi, Yong, editor, van Albada, Geert Dick, editor, Dongarra, Jack, editor, and Sloot, Peter M. A., editor
- Published
- 2007
- Full Text
- View/download PDF
4. Optimizing the Reliability of Streaming Applications Under Throughput Constraints
- Author
-
Benoit, Anne, Bouziane, Hinde Lilia, and Robert, Yves
- Published
- 2011
- Full Text
- View/download PDF
5. Complexity Results for Throughput and Latency Optimization of Replicated and Data-parallel Workflows
- Author
-
Benoit, Anne and Robert, Yves
- Published
- 2010
- Full Text
- View/download PDF
6. Optimal checkpointing period with replicated execution on heterogeneous platforms
- Author
-
Benoit, Anne, Cavelan, Aurélien, Le Fèvre, Valentin, Robert, Yves, École normale supérieure - Lyon (ENS Lyon), Optimisation des ressources : modèles, algorithmes et ordonnancement (ROMA), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon)-Centre National de la Recherche Scientifique (CNRS)-Université de Lyon-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-École normale supérieure - Lyon (ENS Lyon), The University of Tennessee [Knoxville], and INRIA
- Subjects
replication ,checkpoint ,plates-forme hétérogènes ,checkpointing period ,failures ,[INFO]Computer Science [cs] ,heterogeneous platforms ,faute ,période de checkpoint ,résilience ,réplication - Abstract
In this paper, we design and analyze strategies to replicate the execution of an application on two different platformssubject to failures, using checkpointing on a shared stable storage. We derive the optimal pattern size~$W$for a periodic checkpointing strategy where both platforms concurrently try and execute $W$ units of work before checkpointing. The first platform that completes its pattern takes a checkpoint,and the other platform interrupts its execution to synchronize from that checkpoint.We compare this strategy to a simpler on-failure checkpointing strategy, where a checkpoint is taken by one platformonly whenever the other platform encounters a failure. We use first or second-order approximations to computeoverheads and optimal pattern sizes, and show through extensive simulationsthat these models are very accurate. The simulations show the usefulness of a secondary platform to reduce execution time, even when the platforms have relatively different speeds: in average, over a wide range of scenarios, the overhead is reduced by $30\%$.The simulations alsodemonstrate that the periodic checkpointing strategy is globally more efficient, unless platform speeds are quite close.; Ce rapport propose un modèle et une étude analytique de deux stratégies de réplication, combinée avec des prises de checkpoint, sur plates-formes hétérogènes. L'application s'exécute sur deux plates-formes de vitesses et taux de fautes différents, et qui partagent unespace de stockage stable. Nous déterminons la taille optimale du travail $W$ pour une stratégie périodique où les deux plates-formes tentent d'exécuter $W$ unités de travail avant de prendre un checkpoint. La première plate-forme qui réussit prend ce checkpoint, et l'autre s'interromptet se resynchronise avec la première à partir du checkpoint. Nous comparons cette stratégie avec une stratégie plus simple, dite de checkpoint-sur-faute, où un checkpoint n'est pris sur une plate-forme que quand l'autre est sujette à une faute. Nous calculons des approximations du premier et deuxième ordre pour la taille optimale W, et montrons par simulationque celles-ci sont très précises. Les simulations montrent l'utilité d'une seconde plate-forme, même lorsqu'elle a une vitesse relativement différente, puisqu'on gagne 30% en moyenne. En- n, la stratégie périodique est la plus efficace globalement, sauf si les deux plates-formes sont des vitesses très proches.
- Published
- 2017
7. Models and complexity results for performance and energy optimization of concurrent streaming applications
- Author
-
Benoit, Anne, Renaud-Goud, Paul, Robert, Yves, Algorithms and Scheduling for Distributed Heterogeneous Platforms (GRAAL), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire de l'Informatique du Parallélisme (LIP), École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure de Lyon (ENS de Lyon)-Université Claude Bernard Lyon 1 (UCBL), Université de Lyon-Université de Lyon-Centre National de la Recherche Scientifique (CNRS), Laboratoire de l'Informatique du Parallélisme (LIP), Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS), INRIA, École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL), and Université de Lyon-Université de Lyon-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-École normale supérieure - Lyon (ENS Lyon)-Université Claude Bernard Lyon 1 (UCBL)
- Subjects
period ,complexity results ,resource sharing ,concurrent streaming applications ,mapping ,heterogeneous platforms ,[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC] ,latency ,energy - Abstract
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria together with energy consumption. Each application consists in a linear chain graph with several stages, and processes successive data sets in pipeline mode, from the first to the last stage. The problem is to decide which processors to enroll, at which speed (or mode) to use them, and which stages they should execute. There is a clear trade-off to reach, since running faster and/or more processors leads to better performance, but energy consumption is then very high. Energy savings can be achieved at the price of a lower performance, by reducing processor speeds or enrolling fewer resources. We study the problem complexity on different target execution platforms, ranking from fully homogeneous platforms to fully heterogeneous ones. We consider three mapping strategies: (i) one-to-one mappings, where a processor is assigned a single stage; (ii) interval mappings, where a processor may process an interval of consecutive stages of the same application; and (iii) general mappings, which are fully arbitrary, i.e., a processor may process stages of several distinct applications. Finally, we compare two different models for the computation of the latency, which is the time elapsed between the beginning and the end of the execution of a given data set: with the Path model, it is computed as the length of the path taken by this data set, while with the Wavefront model, each data set progresses concurrently within a period. For all platform types, all mapping strategies and both latency models, we establish the complexity of several multi-criteria optimization problems, whose objective functions combine period, latency and energy criteria. In particular, we exhibit instances where the problem is NP-hard with concurrent applications, while it can be solved in polynomial time for a single application, and instances whose problem complexity depends upon the latency model.
- Published
- 2011
8. Multi-criteria Scheduling of Precedence Task Graphs on Heterogeneous Platforms.
- Author
-
Benoit, Anne, Hakem, Mourad, and Robert, Yves
- Subjects
- *
FAULT tolerance (Engineering) , *HEURISTIC programming , *SCHEDULING software , *ALGORITHMS , *GRAPHIC methods - Abstract
Latency, fault tolerance and reliability are important requirements for several applications that are time critical in nature: such applications require guarantees in terms of latency, even when processors are subject to failures. In this paper, we propose a fault-tolerant scheduling heuristic for mapping precedence task graphs on heterogeneous systems. Our approach is based on an active replication scheme, capable of supporting ɛ arbitrary fail-silent/fail-stop processor failures, and hence valid results will be provided even if ɛ processors fail. First we focus on a bi-criteria approach, where we aim at minimizing the latency given a fixed number of failures supported in the system, or the other way round. Next we derive a more complex algorithm in which we not only minimize latency and support a fixed number of failures, but also improve the overall reliability. Major achievements include low complexity of the new algorithms, and a drastic reduction of the number of additional communications induced by the replication mechanism. Experimental results demonstrate that our heuristics, despite their lower complexity, outperform their direct competitor, the fault-tolerance based active replication scheduling algorithm FTBAR. [ABSTRACT FROM PUBLISHER]
- Published
- 2010
- Full Text
- View/download PDF
9. MULTI-CRITERIA SCHEDULING OF PIPELINE WORKFLOWS (AND APPLICATION TO THE JPEG ENCODER).
- Author
-
Benoit, Anne, Kosch, Harald, Rehn-Sonigo, Veronika, and Robert, Yves
- Subjects
- *
LINEAR programming , *HEURISTIC-systematic model (Communication) , *JPEG (Image coding standard) , *SIMULATION methods & models , *HEURISTIC programming , *COMPUTER architecture , *MATHEMATICAL optimization , *COMPUTER network architectures , *WORKFLOW software , *COMMUNICATION models , *INTEGER programming - Abstract
The article presents an integer linear programming formulation of the general bi-criteria scheduling problem for pipeline graphs on communication homogeneous platforms. It outlines several polynomial bi-criteria heuristics, in which relative performance is evaluated through extensive simulations. It highlights the experimental results for the JPEG encoder application pipeline on a cluster of workstations. The results indicate that the efficiency depends on platform parameters such as number of stages and available processors. Further, it shows that the general behavior of the heuristics in the special case of the pipeline workflows has reflected the observations made in the general case.
- Published
- 2009
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.