Search NASA⌕ Search

SEARCH · Search NASA

Results for “checkpoint”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Adaptive multi-level checkpointing

In some examples, with respect to adaptive multi-level checkpointing, a transfer parameter associated with transfer of checkpoint data from a node-local storage to a parallel file system may be ascertained for the checkpoint data stored in the node-local storage. The transfer parameter may be compared to a specified transfer parameter threshold. A determination may be made, based on the comparison of the transfer parameter to the specified transfer parameter threshold, as to whether to transfer the checkpoint data from the node-local storage to the parallel file system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Lossy checkpoint compression in full waveform inversion: a case study with ZFPv0.5.5 and the overthrust model

This paper proposes a new method that combines checkpointing methods with error-controlled lossy compression for large-scale high-performance full-waveform inversion (FWI), an inverse problem commonly used in geophysical exploration. This combination can significantly reduce data movement, allowing a reduction in run time as well as peak memory. In the exascale computing era, frequent data transfer (e.g., memory bandwidth, PCIe bandwidth for GPUs, or network) is the performance bottleneck rather than the peak FLOPS of the processing unit. Like many other adjoint-based optimization problems, FWI is costly in terms of the number of floating-point operations, large memory footprint during backpropagation, and data transfer overheads. Past work for adjoint methods has developed checkpointing methods that reduce the peak memory requirements during backpropagation at the cost of additional floating-point computations. Combining this traditional checkpointing with error-controlled lossy compression, we explore the three-way tradeoff between memory, precision, and time to solution. We investigate how approximation errors introduced by lossy compression of the forward solution impact the objective function gradient and final inverted solution. Empirical results from these numerical experiments indicate that high lossy-compression rates (compression factors ranging up to 100) have a relatively minor impact on convergence rates and the quality of the final solution.

58 GEOSCIENCES↗
NASA NTRS1987

Optimal checkpointing of real-time tasks

Analytical models for the design and evaluation of checkpointing of real-time tasks are developed. First, the execution of a real-time task is modeled under a common assumption of perfect coverage of on-line detection mechanisms (which is termed a basic model). Then, the model is generalized (to an extended model) to include more realistic cases, i.e., imperfect coverages of on-line detection mechanisms and acceptance tests. Finally, an optimal placement of checkpoints is determined to minimize the mean task execution time while the probability of an unreliable result (or lack of confidence) is kept below a specified level. In the basic model, it is shown that equidistant intercheckpoint intervals are optimal, whereas this is not necessarily true in the extended model. An algorithm for calculating the optimal number of checkpoints and intercheckpoint intervals is presented with some numerical examples for the extended model.

Shin, Kang G.↗
DOE OSTI2022

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Melanoma Cell Intrinsic GABAA Receptor Enhancement Potentiates Radiation and Immune Checkpoint Inhibitor Response by Promoting Direct and T Cell-Mediated Antitumor Activity

Most patients with metastatic melanoma show variable responses to radiation therapy and do not benefit from immune checkpoint inhibitors. Improved strategies for combination therapy that leverage potential benefits from radiation therapy and immune checkpoint inhibitors are critical.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2021

Checkpoint kinases are required for oocyte meiotic progression by the maintenance of normal spindle structure and chromosome condensation

Highlights: • Inhibition of Chk1/2 has no significant effects on germinal vesicle breakdown. • Chk1/2 inhibition results in the first polar body extrusion defects. • Chk1/2 is critically involved in meiotic spindle organization. • Inhibition of Chk1/2 leads to abnormal chromosome condensation. • Chk1/2 is important for the development of MII stage oocytes. Checkpoint kinases (Chk) 1/2 are known for DNA damage checkpoint and cell cycle control in somatic cells. According to recent findings, the involvement of Chk1 in oocyte meiotic resumption and Chk2 is regarded as an essential regulator for progression at the post metaphase I stage (MI). In this study, AZD7762 (Chk1/2 inhibitor) and SB218078 (Chk1 inhibitor) were used to uncover the joint roles of Chk1/2 and differentiate the importance of Chk1 and Chk2 during oocyte meiotic maturation. Inhibition of Chk1/2 or Chk1 alone had no significant effect on germinal vesicle breakdown (GVBD) but significantly inhibited the first polar body (PB1). Interestingly, inhibition of Chk1 alone could not increase or completely block the extrusion of PB1 like Chk1/2 inhibition. Also, Chk1/2 inhibition resulted in defective meiotic spindle organization and chromosome condensation both in MI and metaphase II (MII) stages of oocytes. The location of γ-tubulin and Securin were abnormal or missing, while P38 MAPK was activated by Chk1/2 inhibition. Meanwhile, Chk1/2 inhibition reduced the percentage of the second polar body extrusion and pronuclear formation. In conclusion, our results further understand the functions and regulatory mechanism of Chk1/2 during oocyte meiotic maturation.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2023

Immune checkpoint analysis of T‐cell responses to pp65 and IE‐1 antigens in end‐stage lung diseases

Abstract Lung transplant (LTX) patients are at high risk of cytomegalovirus (CMV) infection, which is often associated with high mortality and morbidity. Reactivation of CMV causes cell injury due to the cytopathic effect of viral replication and triggering of T cell immunity. The aim of this study was to compare expression of immune checkpoints (ICs) (PD‐1, CTLA‐4, LAG‐3 and TIGIT) in CD4, CD8 and CD56 and activation markers CD137, CD154 and CD69 of end‐stage patients awaiting lung transplant. Eighteen pre‐LTX positive for anti‐CMV IgG titres and 18 healthy subjects were enrolled. IC and activation markers have been evaluated through flow cytometric analysis in HC and pre‐LTX patients. Reactive (QF+) and unreactive (QF−) patients were stratified according to QuantiFERON‐CMV assays. ICs' and activation markers' expression were determined before and after in vitro stimulation with pp‐65 and IE‐1 antigens. Lower expression of PD‐1 was observed in CD4 and CD8 cells of pre‐LTX patients than controls, whereas CTLA4 appeared upregulated in CD56 and CD8 cells. TIGIT is increased on the surface of CD4, CD8 and NK cells after peptide stimulation in QF‐negative patients and PD‐1 is only downregulated after stimulation in the QF‐positive patients. This study provides new evidence of immune dysregulation in patients with end‐stage lung disorders, particularly in relation to immune checkpoint cell biology. The change in QF+ mostly happens on cytotoxic cells NK and CD8, while the changes in QF− were observed in adaptive immune cells, including CD4 and CD8.

Bergantini, Laura↗
DOE OSTI2026

Selected 3D Flash-X Checkpoints for the Long-Time Evolution of a 9.6 Solar-Mass Core-Collapse Supernova Model

This dataset contains selected 3D Flash-X checkpoint files from the long-time evolution of a low-energy core-collapse supernova explosion of a 9.6 Msun zero-metallicity, low-mass iron-core progenitor. The checkpoints span the shock-breakout phase through the young-remnant phase, ending at approximately 3 yr after core bounce. The dataset is intended for follow-up analysis and post-processing, especially radiation-transport calculations using the hydrodynamic and compositional structure of the ejecta. For a full description of the numerical setup, physical assumptions, limitations, and interpretation of the simulation, users should refer to the associated paper.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1993

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗
NASA NTRS1993

Optimal message log reclamation for independent checkpointing

Independent (uncoordinated) check pointing for parallel and distributed systems allows maximum process autonomy but suffers from possible domino effects and the associated storage space overhead for maintaining multiple checkpoints and message logs. In most research on check pointing and recovery, it was assumed that only the checkpoints and message logs older than the global recovery line can be discarded. It is shown how recovery line transformation and decomposition can be applied to the problem of efficiently identifying all discardable message logs, thereby achieving optimal garbage collection. Communication trace-driven simulation for several parallel programs is used to show the benefits of the proposed algorithm for message log reclamation.

Wang, Yi-Min↗
NASA NTRS1994

Checkpoint-based forward recovery using lookahead execution and rollback validation in parallel and distributed systems

This thesis studies a forward recovery strategy using checkpointing and optimistic execution in parallel and distributed systems. The approach uses replicated tasks executing on different processors for forwared recovery and checkpoint comparison for error detection. To reduce overall redundancy, this approach employs a lower static redundancy in the common error-free situation to detect error than the standard N Module Redundancy scheme (NMR) does to mask off errors. For the rare occurrence of an error, this approach uses some extra redundancy for recovery. To reduce the run-time recovery overhead, look-ahead processes are used to advance computation speculatively and a rollback process is used to produce a diagnosis for correct look-ahead processes without rollback of the whole system. Both analytical and experimental evaluation have shown that this strategy can provide a nearly error-free execution time even under faults with a lower average redundancy than NMR.

Long, Junsheng↗
NASA NTRS1993

Use of common time base for checkpointing and rollback recovery in a distributed system

An approach to checkpointing and rollback recovery in a distributed computing system using a common time base is proposed. A common time base is established in the system using a hardware clock synchronization algorithm. This common time base is coupled with the idea of pseudo-recovery points to develop a checkpointing algorithm that has the following advantages: reduced wait for commitment for establishing recovery lines, fewer messages to be exchanged, and less memory requirement. These advantages are assessed quantitatively by developing a probabilistic model.

Ramanathan, Parameswaran↗
NASA NTRS2024

Operational Integration Assessment (OIA) of Midterm UAM Operations: Class C Airspace Tabletop Exercise and Integration Checkpoint

The National Aeronautics and Space Administration (NASA), in collaboration with the Federal Aviation Administration (FAA), is conducting research into evolving today’s air traffic management system towards a more automated and operationally flexible airspace to accommodate Urban Air Mobility (UAM) operations at scale. UAM operations, enabled by electric Vertical Takeoff and Landing (eVTOL) aircraft, may change the role of aviation in the movement of people and goods and provide practical, cost-effective air transport in metropolitan areas. FAA UAM Concept of Operations v2.0 describes three evolutionary stages of UAM operations: Initial, Midterm, and Mature State operations. Midterm operations are comprised of many complex changes to the national airspace system (NAS). The Operational Integration Assessment (OIA) was created as a capability to address the need to study the progression and identify interdependencies of those changes that may occur during the midterm UAM operations timeframe. The OIA includes a series of tabletop exercises and integration checkpoints planned to explore various use cases from end-to-end, evaluated by NASA’s Air Traffic Management eXploration (ATM-X) project in partnership with the FAA’s William J. Hughes Technical Center (WJHTC) and industry partners. The use cases were exercised in an immersive, integrated live-virtual-constructive (LVC) airspace simulation environment, called the NASA/FAA Laboratory Integrated Test Environment (NFLITE), as part of an effort to learn how UAM operations can scale beyond the as-is NAS and through the transition to higher-tempo and highly automated operations of the future. This document describes the events of the tabletop exercise held from January 24-26, 2023, at the National Airspace Research & Technology Park (NARTP) in Egg Harbor Township, New Jersey, adjacent to the WJHTC and the subsequent integration checkpoint performed on March 28, 2023,at NASA Langley Research Center (LaRC) in Hampton, Virginia.

UAM↗
DOE OSTI2020

Checkpointing using compute node health information

A method is disclosed, as well as an associated apparatus and computer program product, for checkpointing using a plurality of communicatively coupled compute nodes. The method comprises acquiring health information for a first node of the plurality of compute nodes, and determining a first failure probability for the first node using the health information. The first failure probability corresponds to a predetermined time interval. The method further comprises selecting a second node of the plurality of compute nodes as a partner node for the first node. The second node has a second failure probability for the time interval. A composite failure probability of the first node and the second node is less than the first failure probability. The method further comprises copying checkpoint information from the first node to the partner node.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Accelerating shared file checkpoint with local burst buffers

A data management system and method for accelerating shared file checkpointing. Written application data is aggregated in an application data file created in a local burst buffer memory at a compute node, and an associated data mapping built index to maintain information related to the offsets into a shared file at which segments of the application data is to be stored in a parallel file system, and where in the buffer those segments are located. The node asynchronously transfers a data file containing the application data and the associated data mapping index to a file server for shared file storage. The data management system and method further accelerates shared file checkpointing in which a shared file, together with a map file that specifies how the shared file is to be distributed, is asynchronously transferred to local burst buffer memories at the nodes to accelerate reading of the shared file.

Gooding, Thomas↗
DOE OSTI2022

A Novel DNA Repair Gene Signature for Immune Checkpoint Inhibitor-Based Therapy in Gastric Cancer

Gastric cancer is a heterogeneous group of diseases with only a fraction of patients responding to immunotherapy. The relationships between tumor DNA damage response, patient immune system and immunotherapy have recently attracted attention. Accumulating evidence suggests that DNA repair landscape is a significant factor in driving response to immune checkpoint blockade (ICB) therapy. In this study, to explore new prognostic and predictive biomarkers for gastric cancer patients who are sensitive and responsive to immunotherapies, we developed a novel 15-DNA repair gene signature (DRGS) and its related scoring system and evaluated the efficiency of the DRGS in discriminating different molecular and immune characteristics and therapeutic outcomes of patients with gastric adenocarcinoma, using publicly available datasets. The results demonstrated that DRGS high score patients showed significantly better therapeutic outcomes for ICB compared to DRGS low score patients (p < 0.001). Integrated analysis of multi-omics data demonstrated that the patients with high DRGS score were characteristic of high levels of anti-tumor lymphocyte infiltration, tumor mutation burden (TMB) and PD-L1 expression, and these patients exhibited a longer overall survival, as compared to the low-score patients. Results obtained from HPA and IHC supported significant dysregulation of the genes in DRGS in gastric cancer tissues, and a positive correlation in protein expression between DRGS and PD-L1. Therefore, the DRGS scoring system may have implications in tailoring immunotherapy in gastric cancers. A preprint has previously been published (Yuan et al., 2021).

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

An unsupervised machine-learning checkpoint-restart algorithm using Gaussian mixtures for particle-in-cell simulations

We propose an unsupervised machine-learning checkpoint-restart (CR) algorithm for particle-in-cell (PIC) algorithms using Gaussian mixtures (GM). The algorithm compresses the particle population per spatial cell by constructing a velocity distribution function using GM. Particles are reconstructed at restart time by local resampling of the Gaussians. To guarantee fidelity of the CR process, we ensure the exact preservation of invariants such as charge, momentum, and energy for both compression and reconstruction stages, everywhere on the mesh. We also ensure the preservation of Gauss' law after particle reconstruction by exactly matching the density profile at restart time. As a result, the GM CR algorithm is shown to provide a clean, conservative restart capability while potentially affording orders of magnitude savings in input/output requirements. Here, we demonstrate the algorithm using a recently developed exactly energy- and charge-conserving PIC algorithm using both electrostatic and electromagnetic tests. The tests demonstrate not only a high-fidelity CR capability, but also its potential for enhancing the fidelity of the PIC solution for a given particle resolution.

97 MATHEMATICS AND COMPUTING↗