5 Search Results for "Robert, Yves"

Document
DOI: 10.4230/DagRep.5.7.1
Algorithms and Scheduling Techniques to Manage Resilience and Power Consumption in Distributed Systems (Dagstuhl Seminar 15281)

Authors: Henri Casanova, Ewa Deelman, Yves Robert, and Uwe Schwiegelshohn

Published in: Dagstuhl Reports, Volume 5, Issue 7 (2016)

Abstract
Large-scale systems face two main challenges: failure management and energy management. Failure management, the goal of which is to achieve resilience, is necessary because a large number of hardware resources implies a large number of failures during the execution of an application. Energy management, the goal of which is to optimize of power consumption and to handle thermal issues, is also necessary due to both monetary and environmental constraints since typical applications executed in HPC and/or cloud environments will lead to large power consumption and heat dissipation due to intensive computation and communication workloads. The main objective of this Dagstuhl seminar was to gather two communities: (i)~system-oriented researchers who study high-level resource-provisioning policies, pragmatic resource allocation and scheduling heuristics, novel approaches for designing and deploying systems software infrastructures, and tools for monitoring/measuring the state of the system; and (ii)~algorithm-oriented researchers, who investigate formal models and algorithmic solutions for resilience and energy efficiency problems. Both communities focused around workflow applications during the seminar, and discussed various issues related to the efficient, resilient, and energy efficient execution of workflows in distributed platforms. This report provides a brief executive summary of the seminar and lists all the presented material.
Cite as

Henri Casanova, Ewa Deelman, Yves Robert, and Uwe Schwiegelshohn. Algorithms and Scheduling Techniques to Manage Resilience and Power Consumption in Distributed Systems (Dagstuhl Seminar 15281). In Dagstuhl Reports, Volume 5, Issue 7, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{casanova_et_al:DagRep.5.7.1,
  author =	{Casanova, Henri and Deelman, Ewa and Robert, Yves and Schwiegelshohn, Uwe},
  title =	{{Algorithms and Scheduling Techniques to Manage Resilience and Power Consumption in Distributed Systems (Dagstuhl Seminar 15281)}},
  pages =	{1--21},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{7},
  editor =	{Casanova, Henri and Deelman, Ewa and Robert, Yves and Schwiegelshohn, Uwe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.5.7.1},
  URN =		{urn:nbn:de:0030-drops-56705},
  doi =		{10.4230/DagRep.5.7.1},
  annote =	{Keywords: Fault tolerance, Resilience, Energy efficiency, Distributed and high performance computing, Scheduling, Workflows}
}
Document
DOI: 10.4230/DagRep.3.9.106
Algorithms and Scheduling Techniques for Exascale Systems (Dagstuhl Seminar 13381)

Authors: Henri Casanova, Yves Robert, and Uwe Schwiegelshohn

Published in: Dagstuhl Reports, Volume 3, Issue 9 (2014)

Abstract
Exascale systems to be deployed in the near future will come with deep hierarchical parallelism, will exhibit various levels of heterogeneity, will be prone to frequent component failures, and will face tight power consumption constraints. The notion of application performance in these systems becomes multi-criteria, with fault-tolerance and power consumption metrics to be considered in addition to sheer compute speed. As a result, many of the proven algorithmic techniques used in parallel computing for decades will not be effective in Exascale systems unless they are adapted or in some cases radically changed. The Dagstuhl seminar "Algorithms and Scheduling Techniques for Exascale Systems" was aimed at sharing open problems, new results, and prospective ideas broadly connected to the Exascale problem. This report provides a brief executive summary of the seminar and lists all the presented material.
Cite as

Henri Casanova, Yves Robert, and Uwe Schwiegelshohn. Algorithms and Scheduling Techniques for Exascale Systems (Dagstuhl Seminar 13381). In Dagstuhl Reports, Volume 3, Issue 9, pp. 106-129, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@Article{casanova_et_al:DagRep.3.9.106,
  author =	{Casanova, Henri and Robert, Yves and Schwiegelshohn, Uwe},
  title =	{{Algorithms and Scheduling Techniques for Exascale Systems (Dagstuhl Seminar 13381)}},
  pages =	{106--129},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2014},
  volume =	{3},
  number =	{9},
  editor =	{Casanova, Henri and Robert, Yves and Schwiegelshohn, Uwe},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.3.9.106},
  URN =		{urn:nbn:de:0030-drops-44199},
  doi =		{10.4230/DagRep.3.9.106},
  annote =	{Keywords: Exascale computing, high-performance computing and networking, fault-tolerance, power management, scheduling, numerical linear algebra}
}
Document
DOI: 10.4230/DagSemProc.10111.8
Model-Based Testing for the Cloud

Authors: Antonia Bertolino, Wolfgang Grieskamp, Robert Hierons, Yves Le Traon, Bruno Legeard, Henry Muccini, Amit Paradkar, David Rosenblum, and Jan Tretmans

Published in: Dagstuhl Seminar Proceedings, Volume 10111, Practical Software Testing : Tool Automation and Human Factors (2010)

Abstract
Software in the cloud is characterised by the need to be highly adaptive and continuously available. Incremental changes are applied to the deployed system and need to be tested in the field. Different configurations need to be tested. Higher quality standards regarding both functional and non-functional properties are put on those systems, as they often face large and diverse customer bases and/or are used as services from different peer service implementations. The properties of interest include interoperability, privacy, security, reliability, performance, resource use, timing constraints, service dependencies, availability, and so on. This paper discusses the state of the art in model-based testing of cloud systems. It focuses on two central aspects of the problem domain: (a) dealing with the adaptive and dynamic character of cloud software when tested with model-based testing, by developing new online and offline test strategies, and (b) dealing with the variety of modeling concerns for functional and non-functional properties, by devising a unified framework for them where this is possible. Having discussed the state of the art we identify challenges and future directions.
Cite as

Antonia Bertolino, Wolfgang Grieskamp, Robert Hierons, Yves Le Traon, Bruno Legeard, Henry Muccini, Amit Paradkar, David Rosenblum, and Jan Tretmans. Model-Based Testing for the Cloud. In Practical Software Testing : Tool Automation and Human Factors. Dagstuhl Seminar Proceedings, Volume 10111, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)

Copy BibTex To Clipboard

@InProceedings{bertolino_et_al:DagSemProc.10111.8,
  author =	{Bertolino, Antonia and Grieskamp, Wolfgang and Hierons, Robert and Le Traon, Yves and Legeard, Bruno and Muccini, Henry and Paradkar, Amit and Rosenblum, David and Tretmans, Jan},
  title =	{{Model-Based Testing for the Cloud}},
  booktitle =	{Practical Software Testing : Tool Automation and Human Factors},
  pages =	{1--11},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{10111},
  editor =	{Mark Harman and Henry Muccini and Wolfram Schulte and Tao Xie},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.10111.8},
  URN =		{urn:nbn:de:0030-drops-26251},
  doi =		{10.4230/DagSemProc.10111.8},
  annote =	{Keywords: Cloud computing, Model based testing, Non-functional properties}
}
Document
DOI: 10.4230/LIPIcs.STACS.2009.1842
Cover Time and Broadcast Time

Authors: Robert Elsässer and Thomas Sauerwald

Published in: LIPIcs, Volume 3, 26th International Symposium on Theoretical Aspects of Computer Science (2009)

Abstract
We introduce a new technique for bounding the cover time of random walks by relating it to the runtime of randomized broadcast. In particular, we strongly confirm for dense graphs the intuition of Chandra et al. (1997) that ``the cover time of the graph is an appropriate metric for the performance of certain kinds of randomized broadcast algorithms''. In more detail, our results are as follows: \begin{itemize} \item For any graph $G=(V,E)$ of size $n$ and minimum degree $\delta$, we have $\mathcal{R}(G)= \mathcal{O}(\frac{|E|}{\delta} \cdot \log n)$, where $\mathcal{R}(G)$ denotes the quotient of the cover time and broadcast time. This bound is tight for binary trees and tight up to logarithmic factors for many graphs including hypercubes, expanders and lollipop graphs. \item For any $\delta$-regular (or almost $\delta$-regular) graph $G$ it holds that $\mathcal{R}(G) = \Omega(\frac{\delta^2}{n} \cdot \frac{1}{\log n})$. Together with our upper bound on $\mathcal{R}(G)$, this lower bound strongly confirms the intuition of Chandra et al.~for graphs with minimum degree $\Theta(n)$, since then the cover time equals the broadcast time multiplied by $n$ (neglecting logarithmic factors). \item Conversely, for any $\delta$ we construct almost $\delta$-regular graphs that satisfy $\mathcal{R}(G) = \mathcal{O}(\max \{ \sqrt{n},\delta \} \cdot \log^2 n)$. Since any regular expander satisfies $\mathcal{R}(G) = \Theta(n)$, the strong relationship given above does not hold if $\delta$ is polynomially smaller than $n$. \end{itemize} Our bounds also demonstrate that the relationship between cover time and broadcast time is much stronger than the known relationships between any of them and the mixing time (or the closely related spectral gap).
Cite as

Robert Elsässer and Thomas Sauerwald. Cover Time and Broadcast Time. In 26th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 3, pp. 373-384, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{elsasser_et_al:LIPIcs.STACS.2009.1842,
  author =	{Els\"{a}sser, Robert and Sauerwald, Thomas},
  title =	{{Cover Time and Broadcast Time}},
  booktitle =	{26th International Symposium on Theoretical Aspects of Computer Science},
  pages =	{373--384},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-09-5},
  ISSN =	{1868-8969},
  year =	{2009},
  volume =	{3},
  editor =	{Albers, Susanne and Marion, Jean-Yves},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2009.1842},
  URN =		{urn:nbn:de:0030-drops-18421},
  doi =		{10.4230/LIPIcs.STACS.2009.1842},
  annote =	{Keywords: Random walk, Randomized algorithms, Parallel and distributed algorithms}
}
Document
DOI: 10.4230/DagSemRep.66
Parallelization Techniques for Uniform Algorithms (Dagstuhl Seminar 9325)

Authors: Christian Lengauer, Patrice Quinton, Yves Robert, and Lothar Thiele

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Christian Lengauer, Patrice Quinton, Yves Robert, and Lothar Thiele. Parallelization Techniques for Uniform Algorithms (Dagstuhl Seminar 9325). Dagstuhl Seminar Report 66, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1993)

Copy BibTex To Clipboard

@TechReport{lengauer_et_al:DagSemRep.66,
  author =	{Lengauer, Christian and Quinton, Patrice and Robert, Yves and Thiele, Lothar},
  title =	{{Parallelization Techniques for Uniform Algorithms (Dagstuhl Seminar 9325)}},
  pages =	{1--31},
  ISSN =	{1619-0203},
  year =	{1993},
  type = 	{Dagstuhl Seminar Report},
  number =	{66},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.66},
  URN =		{urn:nbn:de:0030-drops-149547},
  doi =		{10.4230/DagSemRep.66},
}
  • Refine by Author
  • 3 Robert, Yves
  • 2 Casanova, Henri
  • 2 Schwiegelshohn, Uwe
  • 1 Bertolino, Antonia
  • 1 Deelman, Ewa
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 1 Cloud computing
  • 1 Distributed and high performance computing
  • 1 Energy efficiency
  • 1 Exascale computing
  • 1 Fault tolerance
  • Show More...

  • Refine by Type
  • 5 document

  • Refine by Publication Year
  • 1 1993
  • 1 2009
  • 1 2010
  • 1 2014
  • 1 2016

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact