Search NASA⌕ Search

SEARCH · Search NASA

Results for “checkpointing”

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 109 records · Page 6

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↗

A conformational checkpoint between DNA binding and cleavage by CRISPR-Cas9

The Cas9 endonuclease is widely used for genome engineering applications by programming its single-guide RNA, and ongoing work is aimed at improving the accuracy and efficiency of DNA targeting. DNA cleavage of Cas9 is controlled by the conformational state of the HNH nuclease domain, but the mechanism that governs HNH activation at on-target DNA while reducing cleavage activity at off-target sites remains poorly understood. Using single-molecule Förster resonance energy transfer, we identified an intermediate state of Streptococcus pyogenes Cas9, representing a conformational checkpoint between DNA binding and cleavage. Upon DNA binding, the HNH domain transitions between multiple conformations before docking into its active state. HNH docking requires divalent cations, but not strand scission, and this docked conformation persists following DNA cleavage. Sequence mismatches between the DNA target and guide RNA prevent transitions from the checkpoint intermediate to the active conformation, providing selective avoidance of DNA cleavage at stably bound off-target sites.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

Insights into Mad2 Regulation in the Spindle Checkpoint Revealed by the Crystal Structure of the Symmetric Mad2 Dimer

In response to misaligned sister chromatids during mitosis, the spindle checkpoint protein Mad2 inhibits the anaphase-promoting complex or cyclosome (APC/C) through binding to its mitotic activator Cdc20, thus delaying anaphase onset. Mad1, an upstream regulator of Mad2, forms a tight core complex with Mad2 and facilitates Mad2 binding to Cdc20. In the absence of its binding proteins, free Mad2 has two natively folded conformers, termed N1-Mad2/open-Mad2 (O-Mad2) and N2-Mad2/closed Mad2 (C-Mad2), with C-Mad2 being more active in APC/CCdc20 inhibition. Here, we show that whereas O-Mad2 is monomeric, C-Mad2 forms either symmetric C-Mad2-C-Mad2 (C-C) or asymmetric O-Mad2-C-Mad2 (O-C) dimers. We also report the crystal structure of the symmetric C-C Mad2 dimer, revealing the basis for the ability of unliganded C-Mad2, but not O-Mad2 or liganded C-Mad2, to form symmetric dimers. A Mad2 mutant that predominantly forms the C-C dimer is functional in vitro and in living cells. Finally, the Mad1-Mad2 core complex facilitates the conversion of O-Mad2 to C-Mad2 in vitro. Collectively, our results establish the existence of a symmetric Mad2 dimer and provide insights into Mad1-assisted conformational activation of Mad2 in the spindle checkpoint.

60 APPLIED LIFE SCIENCES↗

Checkpointing Strategies for Shared High-Performance Computing Platforms

Input/output (I/O) from various sources often contend for scarcely available bandwidth. For example, checkpoint/restart (CR) protocols can help to ensure application progress in failure-prone environments. However, CR I/O alongside an application's normal, requisite I/O can increase I/O contention and might negatively impact performance. In this work, we consider different aspects (system-level scheduling policies and hardware) that optimize the overall performance of concurrently executing CR-based applications that share I/O resources. We provide a theoretical model and derive a set of necessary constraints to minimize the global waste on a given platform. Our results demonstrate that Young/Daly's optimal checkpoint interval, despite providing a sensible metric for a single, undisturbed application, is not sufficient to optimally address resource contention at scale. We show that by combining optimal checkpointing periods with contention-aware system-level I/O scheduling strategies, we can significantly improve overall application performance and maximize the platform throughput. Finally, we evaluate how specialized hardware, namely burst buffers, may help to mitigate the I/O contention problem. Altogether, these results provide critical analysis and direct guidance on how to design efficient, CR ready, large -scale platforms without a large investment in the I/O subsystem.

97 MATHEMATICS AND COMPUTING↗

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↗

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↗

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↗

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↗

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↗

A Structural Hinge in Eukaryotic MutY Homologues Mediates Catalytic Activity and Rad9-Rad1-Hus1 Checkpoint Complex Interactions

The DNA glycosylase MutY homologue (MYH or MUTYH) removes adenines misincorporated opposite 8-oxoguanine as part of the base excision repair pathway. Importantly, defects in human MYH (hMYH) activity cause the inherited colorectal cancer syndrome MYH-associated polyposis. A key feature of MYH activity is its coordination with cell cycle checkpoint via interaction with the Rad9-Rad1-Hus1 (9-1-1) complex. The 9-1-1 complex facilitates cell cycle checkpoint activity and coordinates this activity with ongoing DNA repair. The interdomain connector (IDC, residues 295-350) between the catalytic domain and the 8-oxoguanine recognition domain of hMYH is a critical element that maintains interactions with the 9-1-1 complex. We report the first crystal structure of a eukaryotic MutY protein, a fragment of hMYH (residues 65-350) that consists of the catalytic domain and the IDC. Our structure reveals that the IDC adopts a stabilized conformation projecting away from the catalytic domain to form a docking scaffold for 9-1-1. We further examined the role of the IDC using Schizosaccharomyces pombe MYH as model system. In vitro studies of S. pombe MYH identified residues I261 and E262 of the IDC (equivalent to V315 and E316 of the hMYH IDC) as critical for maintaining the MYH/9-1-1 interaction. We determined that the eukaryotic IDC is also required for DNA damage selection and robust enzymatic activity. Our studies also provide the first evidence that disruption of the MYH/9-1-1 interaction diminishes the repair of oxidative DNA damage in vivo. Thus, preserving the MYH/9-1-1 interaction contributes significantly to minimizing the mutagenic potential of oxidative DNA damage.

59 BASIC BIOLOGICAL SCIENCES↗

Cloud object store for checkpoints of high performance computing applications using decoupling middleware

Cloud object storage is enabled for checkpoints of high performance computing applications using a middleware process. A plurality of files, such as checkpoint files, generated by a plurality of processes in a parallel computing system are stored by obtaining said plurality of files from said parallel computing system; converting said plurality of files to objects using a log structured file system middleware process; and providing said objects for storage in a cloud object storage system. The plurality of processes may run, for example, on a plurality of compute nodes. The log structured file system middleware process may be embodied, for example, as a Parallel Log-Structured File System (PLFS). The log structured file system middleware process optionally executes on a burst buffer node.

97 MATHEMATICS AND COMPUTING↗

Extending the Binomial Checkpointing Technique for Resilience

In terms of computing time, adjoint methods offer a very attractive alternative to compute gradient information, re- quired, e.g., for optimization purposes. However, together with this very favorable temporal complexity result comes a memory requirement that is in essence proportional with the operation count of the underlying function, e.g., if algo- rithmic differentiation is used to provide the adjoints. For this reason, checkpointing approaches in many variants have become popular. This paper analyzes an extension of the so-called binomial approach to cover also possible failures of the computing systems. Such a measure of precaution is of special interest for massive parallel simulations and adjoint calculations where the mean time between failure of the large scale computing system is smaller than the time needed to complete the calculation of the adjoint information. We de- scribe the extensions of standard checkpointing approaches required for such resilience, provide a corresponding imple- mentation and discuss numerical results.

Walther, Andrea↗

Covering Resilience: A Recent Development for Binomial Checkpointing

In terms of computing time, adjoint methods offer a very attractive alternative to compute gradient information, required, e.g., for optimization purposes. However, together with this very favorable temporal complexity result comes a memory requirement that is in essence proportional with the operation count of the underlying function, e.g., if algorithmic differentiation is used to provide the adjoints. For this reason, checkpointing approaches in many variants have become popular. This paper analyzes an extension of the so-called binomial approach to cover also possible failures of the computing systems. Such a measure of precaution is of special interest for massive parallel simulations and adjoint calculations where the mean time between failure of the large scale computing system is smaller than the time needed to complete the calculation of the adjoint information. We describe the extensions of standard checkpointing approaches required for such resilience, provide a corresponding implementation and discuss first numerical results.

Walther, Andrea↗

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↗

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↗

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↗

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↗