首页 > 最新文献
paperpass

2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)最新文献

英文 中文
From tasks graphs to asynchronous distributed checkpointing with local restart 从任务图到具有本地重启的异步分布式检查点
Pub Date : 2020-11-01 DOI: 10.1109/FTXS51974.2020.00009
Romain Lion, Samuel Thibault
The ever-increasing number of computation units assembled in current HPC platforms leads to a concerning increase in fault probability. Traditional checkpoint/restart strategies avoid wasting large amounts of computation time when such fault occurs. With the increasing amount of data dealt with by current applications, these strategies however suffer from their data transfer demand becoming unreasonable, or the entailed global synchronizations. Meanwhile, the current trend towards task-based programming is an opportunity to revisit the principles of the checkpoint/restart strategies. We here propose a checkpointing scheme which is closely tied to the execution of task graphs. We describe how it allows for completely asynchronous and distributed checkpointing, as well as localized node restart, thus opening up for very large scalability. We also show how a synergy between the application data transfers and the checkpointing transfers can lead to a reasonable additional network load, measured to be lower than +10 % on a dense linear algebra example.
当前高性能计算平台上的计算单元数量不断增加,导致故障概率也在不断增加。传统的检查点/重启策略避免了在发生此类故障时浪费大量的计算时间。然而,随着当前应用程序处理的数据量的增加,这些策略受到数据传输需求变得不合理或所需的全局同步的影响。同时,当前基于任务的编程趋势是一个重新审视检查点/重新启动策略原则的机会。我们在这里提出了一个检查点方案,它与任务图的执行密切相关。我们描述了它如何允许完全异步和分布式检查点,以及本地化节点重启,从而打开了非常大的可伸缩性。我们还展示了应用程序数据传输和检查点传输之间的协同如何导致合理的额外网络负载,在密集线性代数示例中测量的负载低于+ 10%。
{"title":"From tasks graphs to asynchronous distributed checkpointing with local restart","authors":"Romain Lion, Samuel Thibault","doi":"10.1109/FTXS51974.2020.00009","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00009","url":null,"abstract":"The ever-increasing number of computation units assembled in current HPC platforms leads to a concerning increase in fault probability. Traditional checkpoint/restart strategies avoid wasting large amounts of computation time when such fault occurs. With the increasing amount of data dealt with by current applications, these strategies however suffer from their data transfer demand becoming unreasonable, or the entailed global synchronizations. Meanwhile, the current trend towards task-based programming is an opportunity to revisit the principles of the checkpoint/restart strategies. We here propose a checkpointing scheme which is closely tied to the execution of task graphs. We describe how it allows for completely asynchronous and distributed checkpointing, as well as localized node restart, thus opening up for very large scalability. We also show how a synergy between the application data transfers and the checkpointing transfers can lead to a reasonable additional network load, measured to be lower than +10 % on a dense linear algebra example.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123603838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Proceedings of FTXS 2020: Fault Tolerance for HPC at eXtreme Scale FTXS 2020:超大规模高性能计算的容错
Pub Date : 2020-11-01 DOI: 10.1109/ftxs51974.2020.00001
{"title":"Proceedings of FTXS 2020: Fault Tolerance for HPC at eXtreme Scale","authors":"","doi":"10.1109/ftxs51974.2020.00001","DOIUrl":"https://doi.org/10.1109/ftxs51974.2020.00001","url":null,"abstract":"","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131022210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Checkpointing OpenSHMEM Programs Using Compiler Analysis 使用编译器分析检查OpenSHMEM程序
Pub Date : 2020-11-01 DOI: 10.1109/FTXS51974.2020.00011
Md Abdullah Shahneous Bari, Debasmita Basu, Wenbin Lu, Tony Curtis, B. Chapman
The importance of fault tolerance continues to increase for HPC applications. The continued growth in size and complexity of HPC systems, and of the applications themselves, is leading to an increased likelihood of failures during execution. However, most HPC programming models do not have a built-in fault tolerance mechanism. Instead, application developers usually rely on external support such as application-level checkpoint-restart (C/R) libraries to make their codes fault tolerant. However, this increases the burden on the application developer, who must use the libraries carefully to ensure correct behavior and to minimize the overheads. The C/R routines will be employed to save the values of all needed program variables at the places in the code where they are invoked. It is important for correctness that the program data is in a consistent state at these places. It is non-trivial to determine such points in OpenSHMEM, which relies upon single-sided communications to provide high performance. The amount of data to be collected, and the frequency with which this is performed, must also be carefully tuned, as the overheads introduced by C/R calls can be extremely high. There is very little prior work on checkpoint-restart support in the context of the OpenSHMEM programming interface. In this paper, we introduce OpenSHMEM and describe the challenges it poses for checkpointing. We identify the safest places for inserting C/R calls in an OpenSHMEM program and describe a straightforward approach for identifying the data that needs to be checkpointed at these positions in the code. We provide these two functionalities in a tool that exploits compiler analyses to propose checkpoints and the sets of data for saving at them, to the application developer.
对于高性能计算应用来说,容错的重要性不断增加。HPC系统和应用程序本身的规模和复杂性的持续增长导致执行过程中失败的可能性增加。然而,大多数HPC编程模型没有内置容错机制。相反,应用程序开发人员通常依赖于外部支持,例如应用程序级检查点重新启动(C/R)库,以使其代码具有容错性。然而,这增加了应用程序开发人员的负担,他们必须小心地使用库以确保正确的行为并尽量减少开销。C/R例程将用于将所有需要的程序变量的值保存在调用它们的代码位置。为了保证程序数据在这些地方处于一致的状态,这一点非常重要。在OpenSHMEM中确定这样的点是非常重要的,它依赖于单面通信来提供高性能。还必须仔细调整要收集的数据量和执行数据的频率,因为C/R调用带来的开销可能非常高。在OpenSHMEM编程接口上下文中,很少有关于检查点重新启动支持的前期工作。在本文中,我们介绍了OpenSHMEM,并描述了它为检查点带来的挑战。我们确定了在OpenSHMEM程序中插入C/R调用的最安全的位置,并描述了一种直接的方法来确定需要在代码中的这些位置检查点的数据。我们在一个工具中提供了这两个功能,该工具利用编译器分析向应用程序开发人员提出检查点和保存在检查点上的数据集。
{"title":"Checkpointing OpenSHMEM Programs Using Compiler Analysis","authors":"Md Abdullah Shahneous Bari, Debasmita Basu, Wenbin Lu, Tony Curtis, B. Chapman","doi":"10.1109/FTXS51974.2020.00011","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00011","url":null,"abstract":"The importance of fault tolerance continues to increase for HPC applications. The continued growth in size and complexity of HPC systems, and of the applications themselves, is leading to an increased likelihood of failures during execution. However, most HPC programming models do not have a built-in fault tolerance mechanism. Instead, application developers usually rely on external support such as application-level checkpoint-restart (C/R) libraries to make their codes fault tolerant. However, this increases the burden on the application developer, who must use the libraries carefully to ensure correct behavior and to minimize the overheads. The C/R routines will be employed to save the values of all needed program variables at the places in the code where they are invoked. It is important for correctness that the program data is in a consistent state at these places. It is non-trivial to determine such points in OpenSHMEM, which relies upon single-sided communications to provide high performance. The amount of data to be collected, and the frequency with which this is performed, must also be carefully tuned, as the overheads introduced by C/R calls can be extremely high. There is very little prior work on checkpoint-restart support in the context of the OpenSHMEM programming interface. In this paper, we introduce OpenSHMEM and describe the challenges it poses for checkpointing. We identify the safest places for inserting C/R calls in an OpenSHMEM program and describe a straightforward approach for identifying the data that needs to be checkpointed at these positions in the code. We provide these two functionalities in a tool that exploits compiler analyses to propose checkpoints and the sets of data for saving at them, to the application developer.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124405237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods 一类迭代线性代数方法的节点故障恢复策略
Pub Date : 2020-11-01 DOI: 10.1109/FTXS51974.2020.00010
C. Pachajoa, Robert Ernstbrunner, W. Gansterer
Resilience is an important research topic in HPC. As computer clusters go to extreme scales, work in this area is necessary to keep these machines reliable. In this work, we introduce a generic method to endow iterative algorithms in linear algebra based on sparse matrix-vector products, such as linear system solvers, eigensolvers and similar, with resilience to node failures. This generic method traverses the dependency graph of the variables of the iterative algorithm. If the iterative method exhibits certain properties, it is possible to produce an exact state reconstruction (ESR) algorithm, enabling the recovery of the state of the iterative method in the event of a node failure. This reconstruction is exact, except for small perturbations caused by floating point arithmetic. The generic method exploits redundancy in the matrix-vector product to protect the vector that is the argument of the product. We illustrate the use of this generic approach on three iterative methods: the conjugate gradient method, the BiCGStab method and the Lanczos algorithm. The resulting ESR algorithms enable the reconstruction of their state after a node failure from a few redundantly stored vectors. Unlike previous work in preconditioned conjugate gradient, this generic method produces ESR algorithms that work with general matrices. Consequently, we can no longer assume that local diagonal submatrices used to reconstruct vectors are nonsingular. Thus, we also propose an approach for deriving nonsingular local linear systems for the reconstruction process with reduced condition numbers, based on a communication-avoiding rank-revealing QR factorization with column pivoting.
弹性是高性能计算中的一个重要研究课题。随着计算机集群达到极限规模,这方面的工作对于保持这些机器的可靠性是必要的。在这项工作中,我们引入了一种通用的方法来赋予基于稀疏矩阵向量积的线性代数迭代算法,如线性系统求解器、特征求解器和类似的算法,对节点故障具有弹性。这种泛型方法遍历迭代算法变量的依赖关系图。如果迭代方法显示出某些属性,则可以生成精确的状态重建(ESR)算法,从而在节点故障的情况下恢复迭代方法的状态。这种重建是精确的,除了浮点运算引起的小扰动。一般方法利用矩阵-向量乘积中的冗余来保护作为乘积参数的向量。我们举例说明了这种通用方法在三种迭代方法上的应用:共轭梯度法、BiCGStab法和Lanczos算法。由此产生的ESR算法能够从一些冗余存储的向量中重建节点故障后的状态。与先前在预条件共轭梯度中的工作不同,这种通用方法产生了适用于一般矩阵的ESR算法。因此,我们不能再假设用于重构向量的局部对角子矩阵是非奇异的。因此,我们还提出了一种基于具有列枢轴的避免通信的揭示秩的QR分解的方法,用于导出具有简化条件数的重构过程的非奇异局部线性系统。
{"title":"A Generic Strategy for Node-Failure Resilience for Certain Iterative Linear Algebra Methods","authors":"C. Pachajoa, Robert Ernstbrunner, W. Gansterer","doi":"10.1109/FTXS51974.2020.00010","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00010","url":null,"abstract":"Resilience is an important research topic in HPC. As computer clusters go to extreme scales, work in this area is necessary to keep these machines reliable. In this work, we introduce a generic method to endow iterative algorithms in linear algebra based on sparse matrix-vector products, such as linear system solvers, eigensolvers and similar, with resilience to node failures. This generic method traverses the dependency graph of the variables of the iterative algorithm. If the iterative method exhibits certain properties, it is possible to produce an exact state reconstruction (ESR) algorithm, enabling the recovery of the state of the iterative method in the event of a node failure. This reconstruction is exact, except for small perturbations caused by floating point arithmetic. The generic method exploits redundancy in the matrix-vector product to protect the vector that is the argument of the product. We illustrate the use of this generic approach on three iterative methods: the conjugate gradient method, the BiCGStab method and the Lanczos algorithm. The resulting ESR algorithms enable the reconstruction of their state after a node failure from a few redundantly stored vectors. Unlike previous work in preconditioned conjugate gradient, this generic method produces ESR algorithms that work with general matrices. Consequently, we can no longer assume that local diagonal submatrices used to reconstruct vectors are nonsingular. Thus, we also propose an approach for deriving nonsingular local linear systems for the reconstruction process with reduced condition numbers, based on a communication-avoiding rank-revealing QR factorization with column pivoting.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114964377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Models for Resilience Design Patterns 弹性设计模式模型
Pub Date : 2020-11-01 DOI: 10.1109/FTXS51974.2020.00008
M. Kumar, C. Engelmann
Resilience plays an important role in supercomputers by providing correct and efficient operation in case of faults, errors, and failures. Resilience design patterns offer blueprints for effectively applying resilience technologies. Prior work focused on developing initial efficiency and performance models for resilience design patterns. This paper extends it by (1) describing performance, reliability, and availability models for all structural resilience design patterns, (2) providing more detailed models that include flowcharts and state diagrams, and (3) introducing the Resilience Design Pattern Modeling (RDPM) tool that calculates and plots the performance, reliability, and availability metrics of individual patterns and pattern combinations.
弹性在超级计算机中扮演着重要的角色,它在故障、错误和失败的情况下提供正确和有效的操作。弹性设计模式为有效地应用弹性技术提供了蓝图。先前的工作重点是开发弹性设计模式的初始效率和性能模型。本文通过(1)描述所有结构弹性设计模式的性能、可靠性和可用性模型,(2)提供更详细的模型,包括流程图和状态图,以及(3)引入弹性设计模式建模(RDPM)工具来计算和绘制单个模式和模式组合的性能、可靠性和可用性度量。
{"title":"Models for Resilience Design Patterns","authors":"M. Kumar, C. Engelmann","doi":"10.1109/FTXS51974.2020.00008","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00008","url":null,"abstract":"Resilience plays an important role in supercomputers by providing correct and efficient operation in case of faults, errors, and failures. Resilience design patterns offer blueprints for effectively applying resilience technologies. Prior work focused on developing initial efficiency and performance models for resilience design patterns. This paper extends it by (1) describing performance, reliability, and availability models for all structural resilience design patterns, (2) providing more detailed models that include flowcharts and state diagrams, and (3) introducing the Resilience Design Pattern Modeling (RDPM) tool that calculates and plots the performance, reliability, and availability metrics of individual patterns and pattern combinations.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115847320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improving Scalability of Silent-Error Resilience for Message-Passing Solvers via Local Recovery and Asynchrony 通过本地恢复和异步提高消息传递求解器的沉默错误弹性的可伸缩性
Pub Date : 2020-11-01 DOI: 10.1109/FTXS51974.2020.00006
H. Kolla, J. Mayo, K. Teranishi, R. Armstrong
Benefits of local recovery (restarting only a failed process or task) have been previously demonstrated in parallel solvers. Local recovery has a reduced impact on application performance due to masking of failure delays (for message-passing codes) or dynamic load balancing (for asynchronous many-task codes). In this paper, we implement MPI-process-local checkpointing and recovery of data (as an extension of the Fenix library) in combination with an existing method for local detection of silent errors in partial-differential-equation solvers, to show a path for incorporating lightweight silent-error resilience. In addition, we demonstrate how asynchrony introduced by maximizing computation-communication overlap can halt the propagation of delays. For a prototype stencil solver (including an iterative-solver-like variant) with injected memory bit flips, results show greatly reduced overhead under weak scaling compared to global recovery, and high failure-masking efficiency. The approach is expected to be generalizable to other MPI-based solvers.
本地恢复(只重新启动失败的进程或任务)的好处已经在并行求解器中得到了证明。由于屏蔽了故障延迟(用于消息传递代码)或动态负载平衡(用于异步多任务代码),本地恢复对应用程序性能的影响较小。在本文中,我们将mpi -进程-局部检查点和数据恢复(作为Fenix库的扩展)与现有的局部检测偏微分方程解算器中的沉默错误的方法相结合,以显示合并轻量级沉默错误弹性的路径。此外,我们还演示了通过最大化计算-通信重叠引入的异步如何阻止延迟的传播。对于具有注入内存位翻转的原型模板求解器(包括类似迭代求解器的变体),结果表明与全局恢复相比,在弱缩放下大大降低了开销,并且具有较高的故障屏蔽效率。该方法有望推广到其他基于mpi的求解器。
{"title":"Improving Scalability of Silent-Error Resilience for Message-Passing Solvers via Local Recovery and Asynchrony","authors":"H. Kolla, J. Mayo, K. Teranishi, R. Armstrong","doi":"10.1109/FTXS51974.2020.00006","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00006","url":null,"abstract":"Benefits of local recovery (restarting only a failed process or task) have been previously demonstrated in parallel solvers. Local recovery has a reduced impact on application performance due to masking of failure delays (for message-passing codes) or dynamic load balancing (for asynchronous many-task codes). In this paper, we implement MPI-process-local checkpointing and recovery of data (as an extension of the Fenix library) in combination with an existing method for local detection of silent errors in partial-differential-equation solvers, to show a path for incorporating lightweight silent-error resilience. In addition, we demonstrate how asynchrony introduced by maximizing computation-communication overlap can halt the propagation of delays. For a prototype stencil solver (including an iterative-solver-like variant) with injected memory bit flips, results show greatly reduced overhead under weak scaling compared to global recovery, and high failure-masking efficiency. The approach is expected to be generalizable to other MPI-based solvers.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121770775","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Towards Distributed Software Resilience in Asynchronous Many- Task Programming Models 异步多任务编程模型中的分布式软件弹性研究
Pub Date : 2020-10-19 DOI: 10.1109/FTXS51974.2020.00007
Nikunj Gupta, J. Mayo, Adrian S. Lemoine, Hartmut Kaiser
Exceptions and errors occurring within mission critical applications due to hardware failures have a high cost. With the emerging Next Generation Platforms (NGPs), the rate of hardware failures will likely increase. Therefore, designing our applications to be resilient is a critical concern in order to retain the reliability of results while meeting the constraints on power budgets. In this paper, we discuss software resilience in AMTs at both local and distributed scale. We choose HPX to prototype our resiliency designs. We implement two resiliency APIs that we expose to the application developers, namely task replication and task replay. Task replication repeats a task n-times and executes them asynchronously. Task replay reschedules a task up to n-times until a valid output is returned. Furthermore, we expose algorithm based fault tolerance (ABFT) using user provided predicates (e.g., checksums) to validate the returned results. We benchmark the resiliency scheme for both synthetic and real world applications at local and distributed scale and show that most of the added execution time arises from the replay, replication or data movement of the tasks and not the boilerplate code added to achieve resilience.
由于硬件故障而在关键任务应用程序中发生的异常和错误具有很高的成本。随着下一代平台(NGPs)的出现,硬件故障率可能会增加。因此,设计具有弹性的应用程序是一个关键问题,以便在满足功率预算限制的同时保持结果的可靠性。本文从本地和分布式两方面讨论了自动传输系统的软件弹性。我们选择HPX作为弹性设计的原型。我们实现了两个向应用程序开发人员公开的弹性api,即任务复制和任务重播。任务复制将任务重复n次,并异步执行它们。任务重放最多可重调度n次任务,直到返回有效输出。此外,我们使用用户提供的谓词(例如校验和)公开基于算法的容错(ABFT)来验证返回的结果。我们对本地和分布式规模的合成应用程序和实际应用程序的弹性方案进行了基准测试,结果表明,大部分增加的执行时间来自任务的重放、复制或数据移动,而不是为实现弹性而添加的样板代码。
{"title":"Towards Distributed Software Resilience in Asynchronous Many- Task Programming Models","authors":"Nikunj Gupta, J. Mayo, Adrian S. Lemoine, Hartmut Kaiser","doi":"10.1109/FTXS51974.2020.00007","DOIUrl":"https://doi.org/10.1109/FTXS51974.2020.00007","url":null,"abstract":"Exceptions and errors occurring within mission critical applications due to hardware failures have a high cost. With the emerging Next Generation Platforms (NGPs), the rate of hardware failures will likely increase. Therefore, designing our applications to be resilient is a critical concern in order to retain the reliability of results while meeting the constraints on power budgets. In this paper, we discuss software resilience in AMTs at both local and distributed scale. We choose HPX to prototype our resiliency designs. We implement two resiliency APIs that we expose to the application developers, namely task replication and task replay. Task replication repeats a task n-times and executes them asynchronously. Task replay reschedules a task up to n-times until a valid output is returned. Furthermore, we expose algorithm based fault tolerance (ABFT) using user provided predicates (e.g., checksums) to validate the returned results. We benchmark the resiliency scheme for both synthetic and real world applications at local and distributed scale and show that most of the added execution time arises from the replay, replication or data movement of the tasks and not the boilerplate code added to achieve resilience.","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132687281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Workshop Organization 车间组织
Pub Date : 2018-09-01 DOI: 10.1109/PERCOMW.2005.96
R. Badia
Program Committee Scott Baden – University of California San Diego, USA Rosa M. Badia – Barcelona Supercomputing Center, Spain Bradford L. Chamberlain – Cray, a Hewlett Packard Enterprise company, USA Kyle Chard – University of Chicago, USA Valentin Churavy – Massachusetts Institute of Technology, USA Magne Haveraaen – University of Bergen, Norway Engin Kayraklioglu – Cray, a Hewlett Packard Enterprise company, USA Elisabeth Larsson – Uppsala University, Sweden Bill Long – Cray, a Hewlett Packard Enterprise company, USA Xavier Martorell – Barcelona Supercomputing Center, Spain Patrick McCormick – Los Alamos National Laboratory, USA Esteban Meneses Rojas – National High Technology Center, Costa Rica Karla Morris – Sandia National Laboratories, USA Francesco Rizzi – NextGen Analytics, Italy Mitsuhisa Sato – RIKEN Advanced Institute for Computational Science, Japan Gabriel Tanase – Amazon Web Services, USA Kenjiro Taura – University of Tokyo, Japan Sean Treichler – NVIDIA, USA
项目委员会Scott Baden -加州大学圣地亚哥分校,美国Rosa M. Badia -巴塞罗那超级计算中心,西班牙Bradford L. Chamberlain - Cray,惠普企业公司,美国Kyle Chard -芝加哥大学,美国Valentin Churavy -麻省理工学院,美国Magne Haveraaen -卑尔根大学,挪威Engin Kayraklioglu - Cray,惠普企业公司,美国Elisabeth Larsson -乌普萨拉大学,瑞典Bill Long - Cray,惠普企业公司,美国Xavier Martorell -巴塞罗那超级计算中心,西班牙Patrick McCormick -洛斯阿拉莫斯国家实验室,美国Esteban Meneses Rojas -国家高技术中心,哥斯达黎加Karla Morris -桑迪亚国家实验室,美国Francesco Rizzi - NextGen分析,意大利佐藤光久- RIKEN高级计算科学研究所,日本Gabriel Tanase -亚马逊网络服务,美国Taura健二郎-东京大学,Sean Treichler - NVIDIA,美国
{"title":"Workshop Organization","authors":"R. Badia","doi":"10.1109/PERCOMW.2005.96","DOIUrl":"https://doi.org/10.1109/PERCOMW.2005.96","url":null,"abstract":"Program Committee Scott Baden – University of California San Diego, USA Rosa M. Badia – Barcelona Supercomputing Center, Spain Bradford L. Chamberlain – Cray, a Hewlett Packard Enterprise company, USA Kyle Chard – University of Chicago, USA Valentin Churavy – Massachusetts Institute of Technology, USA Magne Haveraaen – University of Bergen, Norway Engin Kayraklioglu – Cray, a Hewlett Packard Enterprise company, USA Elisabeth Larsson – Uppsala University, Sweden Bill Long – Cray, a Hewlett Packard Enterprise company, USA Xavier Martorell – Barcelona Supercomputing Center, Spain Patrick McCormick – Los Alamos National Laboratory, USA Esteban Meneses Rojas – National High Technology Center, Costa Rica Karla Morris – Sandia National Laboratories, USA Francesco Rizzi – NextGen Analytics, Italy Mitsuhisa Sato – RIKEN Advanced Institute for Computational Science, Japan Gabriel Tanase – Amazon Web Services, USA Kenjiro Taura – University of Tokyo, Japan Sean Treichler – NVIDIA, USA","PeriodicalId":123780,"journal":{"name":"2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114168487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
2020 IEEE/ACM 10th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1