Resilient X10

Cunningham, David; Grove, David; Herta, Benjamin; Iyengar, Arun; Kawachiya, Kiyokuni; Murata, Hiroki; Saraswat, Vijay; Takeuchi, Mikio; Tardieu, Olivier

doi:10.1145/2692916.2555248

Cited by 7 publications

(2 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been many efforts to introduce fault tolerance protocol in PGAS-model languages (Cunningham et al, 2014;Besta and Hoefler, 2014;Ali et al, 2011) but, to our knowledge, there is no such contribution for GASPI so far. GASPI is arguably the first PGAS based communication library, in which fault tolerance basics are embedded right from its development phase.…”

Section: Related Workmentioning

confidence: 99%

Building and utilizing fault tolerance support tools for the GASPI applications

Shahzad

Kreutzer

Zeiser

et al. 2016

The International Journal of High Performance Computing Applica

View full text Add to dashboard Cite

Todays high performance computing systems are made possible by multiple increases in hardware parallelity. This results in the decrease of mean time to failures of the systems with each newer generation, which is an alarming trend. Therefore, it is not surprising that a lot of research is going on in the area of fault tolerance and fault mitigation. Applications should survive a failure and/or be able to recover with minimal cost. We have used Global Address Space Programming Interface (GASPI), which is a relatively new communication library based on the PGAS model. It fulfills the basic requirement of a fault tolerant communication library, i.e. the failure of a process does not cause the remaining processes to fail. This work is focused on extending the fault tolerance features of GASPI in the form of a supporting health-check library that applications can benefit from. These features include failure detection, its information propagation, recovery management, communication recovery, etc. To reinforce its utility, we have also developed a fault tolerant neighbor node-level checkpoint/restart library. Instead of introducing algorithm-based fault tolerance in its true sense, we demonstrate how (using these supplementary fault tolerance functions) one can build applications to allow integrate a low cost fault detection/recovery mechanism and, if necessary, recover the application on the fly. We showcase the usage of these tools by implementing them in three different applications. Two of the applications fall in the category of linear sparse solvers, whereas the third application is based on a fluid flow solver. We also analyze the overheads involved in failure-free cases as well as various failure cases. Our fault detection mechanism causes no overhead in failure-free cases, whereas in case of failure(s), the failure detection and recovery cost is of reasonably acceptable order and shows good scalability

show abstract

Section: Related Workmentioning

confidence: 99%

Building and utilizing fault tolerance support tools for the GASPI applications

Shahzad

Kreutzer

Zeiser

et al. 2016

The International Journal of High Performance Computing Applica

View full text Add to dashboard Cite

show abstract

“…The ability to apply mathematics in chemistry is fundamental to solve many problems, such as the use of logarithms to determine the pH value of a solution, or how to properly express the equilibrium constants of a chemical process, i.e., the relationship between p K and K values. Nevertheless, many students struggle with their mathematical skills and knowledge . Besides, when they are asked the same question in a different way, they usually do not know how to solve the problem, which makes the subject difficult and boring for them.…”

Section: Introductionmentioning

confidence: 99%

“MasterChemist”: A Novel Strategy for Reviewing Stoichiometry and Introducing Molecular Gastronomy to Chemistry Students

2022

View full text Add to dashboard Cite

This article presents and discusses the results of an educational innovation that seeks to introduce the world of molecular gastronomy in chemistry lessons as a means to review stoichiometry and offer an alternative way to learn. In the literature to date, there is no evidence of haute cuisine having been employed to contextualize stoichiometry problem statements with its everyday applications. The proposed novel strategy, called “MasterChemist”, involved the participation of Spanish first-year university students taking the subject General Chemistry in the Bachelor’s Degree in Chemical Engineering. A Game-Based Learning (GBL) approach was used to solve the exercises and make the activity more appealing and interesting by adding fun to the learning process. The problems were contextualized in the use of siphons, isomalt sugar, and the spherification technique. Furthermore, dividing students into groups also boosted their cooperative skills. The students’ answers to a final survey revealed that the general opinion regarding the activity was highly positive. The undergraduates reviewed some stoichiometry concepts which we had previously observed that they had problems understanding. In addition, the attractive theme of haute cuisine made the activity dynamic and enjoyable both for students and for the teacher.

show abstract

Resilient Optimistic Termination Detection for the Async-Finish Model

Hamouda

Milthorpe

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

2[0000−0001−7300−9565] and Josh Milthorpe 1[0000−0002−3588−9896]Abstract. Driven by increasing core count and decreasing mean-time-to-failure in supercomputers, HPC runtime systems must improve support for dynamic task-parallel execution and resilience to failures. The async-finish task model, adapted for distributed systems as the asynchronous partitioned global address space programming model, provides a simple way to decompose a computation into nested task groups, each managed by a 'finish' that signals the termination of all tasks within the group. For distributed termination detection, maintaining a consistent view of task state across multiple unreliable processes requires additional book-keeping when creating or completing tasks and finish-scopes. Runtime systems which perform this book-keeping pessimistically, i.e. synchronously with task state changes, add a high communication overhead compared to non-resilient protocols. In this paper, we propose optimistic finish, the first message-optimal resilient termination detection protocol for the async-finish model. By avoiding the communication of certain task and finish events, this protocol allows uncertainty about the global structure of the computation which can be resolved correctly at failure time, thereby reducing the overhead for failure-free execution. Performance results using micro-benchmarks and the LULESH hydrodynamics proxy application show significant reductions in resilience overhead with optimistic finish compared to pessimistic finish. Our optimistic finish protocol is applicable to any task-based runtime system offering automatic termination detection for dynamic graphs of non-migratable tasks.Recent advances in high-performance computing (HPC) systems have greatly increased parallelism, with both larger numbers of nodes, and larger core counts within each node. With increased system size and complexity comes an increase in the expected rate of failures. Programmers of HPC systems must therefore address the twin challenges of efficiently exploiting available parallelism and ensuring resilience to component failures. As more industrial and scientific communities rely on HPC to drive innovation, there is a need for productive programming models for scalable resilient applications.

show abstract

Resilient X10

Cited by 7 publications

References 20 publications

Building and utilizing fault tolerance support tools for the GASPI applications

Building and utilizing fault tolerance support tools for the GASPI applications

“MasterChemist”: A Novel Strategy for Reviewing Stoichiometry and Introducing Molecular Gastronomy to Chemistry Students

Resilient Optimistic Termination Detection for the Async-Finish Model

Contact Info

Product

Resources

About