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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Tactical Analysis for Calculating Contextual Risk at Boundaries: Summary of Laboratory Directed Research & Development Effort

The Tactical Analysis for Calculating Contextual Risk at Boundaries (TACCRAB) tool is an innovative digital twin (DT) platform and automated risk algorithm designed to transform operational decision-making in structured screening environments, with an initial focus on Southern Border Land Ports of Entry (POEs). The invention provides integration points for advanced artificial intelligence, predictive modeling, and real-time data analysis to produce a comprehensive risk management tool that enables proactive, data-informed security strategies. The core inventive features of TACCRAB center on its unique risk algorithm, which dynamically calculates contextual risk by synthesizing historical data, near real-time streaming data from the checkpoints themselves, and AI-generated predictions. Unlike traditional risk assessment methods, TACCRAB utilizes a DT to provide comprehensive operational insights, allowing stakeholders to visualize, simulate, and optimize checkpoint configurations with unprecedented speed and contextual awareness. TACCRAB's key innovation lies in its ability to combine multiple complex inputs - including technology detection probabilities, resource availability, screening pathway characteristics, and threat actor behavioral patterns - into a unified risk calculation and update these inputs based on changing operational and environmental conditions. By leveraging a DT that continuously updates and learns from linked data, TACCRAB can suggest adaptive mitigation strategies that minimize risk while maintaining operational efficiency. Particularly novel is the platform's approach to decision support, which goes beyond static risk assessment. The DT provides dynamic metrics such as wait times, resource allocation effectiveness, and potential emerging threat scenarios, enabling users to view sophisticated, relevant what-if simulations and optimize checkpoint operations in near real-time. The system's architecture allows for generalized application across different screening environments, such as secure facilities, ports of entry, and soft targets, making it a versatile tool for security and operational management. The invention distinguishes itself through its comprehensive integration of predictive modeling, AI-driven pattern discovery, and user-friendly interface design. By combining these elements, TACCRAB transforms complex risk data into actionable insights, supporting decision-makers at various organizational levels - from booth agents making split-second screening decisions to checkpoint managers optimizing the day's resource allocation to strategic planners managing long-term investments.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
NASA NTRS1990

Error recovery in shared memory multiprocessors using private caches

The problem of recovering from processor transient faults in shared memory multiprocesses systems is examined. A user-transparent checkpointing and recovery scheme using private caches is presented. Processes can recover from errors due to faulty processors by restarting from the checkpointed computation state. Implementation techniques using checkpoint identifiers and recovery stacks are examined as a means of reducing performance degradation in processor utilization during normal execution. This cache-based checkpointing technique prevents rollback propagation, provides rapid recovery, and can be integrated into standard cache coherence protocols. An analytical model is used to estimate the relative performance of the scheme during normal execution. Extensions to take error latency into account are presented.

Wu, Kun-Lung↗
NASA NTRS1990

Recoverable distributed shared virtual memory

The problem of rollback recovery in distributed shared virtual environments, in which the shared memory is implemented in software in a loosely coupled distributed multicomputer system, is examined. A user-transparent checkpointing recovery scheme and a new twin-page disk storage management technique are presented for implementing recoverable distributed shared virtual memory. The checkpointing scheme can be integrated with the memory coherence protocol for managing the shared virtual memory. The twin-page disk design allows checkpointing to proceed in an incremental fashion without an explicit undo at the time of recovery. The recoverable distributed shared virtual memory allows the system to restart computation from a checkpoint without a global restart.

Wu, Kun-Lung↗
NASA NTRS1991

Experimental evaluation of multiprocessor cache-based error recovery

Several variations of cache-based checkpointing for rollback error recovery in shared-memory multiprocessors have been recently developed. By modifying the cache replacement policy, these techniques use the inherent redundancy in the memory hierarchy to periodically checkpoint the computation state. Three schemes, different in the manner in which they avoid rollback propagation, are evaluated. By simulation with address traces from parallel applications running on an Encore Multimax shared-memory multiprocessor, the performance effect of integrating the recovery schemes in the cache coherence protocol are evaluated. The results indicate that the cache-based schemes can provide checkpointing capability with low performance overhead but uncontrollable high variability in the checkpoint interval.

Janssens, Bob↗
NASA NTRS2000

JavaGenes and Condor: Cycle-Scavenging Genetic Algorithms

A genetic algorithm code, JavaGenes, was written in Java and used to evolve pharmaceutical drug molecules and digital circuits. JavaGenes was run under the Condor cycle-scavenging batch system managing 100-170 desktop SGI workstations. Genetic algorithms mimic biological evolution by evolving solutions to problems using crossover and mutation. While most genetic algorithms evolve strings or trees, JavaGenes evolves graphs representing (currently) molecules and circuits. Java was chosen as the implementation language because the genetic algorithm requires random splitting and recombining of graphs, a complex data structure manipulation with ample opportunities for memory leaks, loose pointers, out-of-bound indices, and other hard to find bugs. Java garbage-collection memory management, lack of pointer arithmetic, and array-bounds index checking prevents these bugs from occurring, substantially reducing development time. While a run-time performance penalty must be paid, the only unacceptable performance we encountered was using standard Java serialization to checkpoint and restart the code. This was fixed by a two-day implementation of custom checkpointing. JavaGenes is minimally integrated with Condor; in other words, JavaGenes must do its own checkpointing and I/O redirection. A prototype Java-aware version of Condor was developed using standard Java serialization for checkpointing. For the prototype to be useful, standard Java serialization must be significantly optimized. JavaGenes is approximately 8700 lines of code and a few thousand JavaGenes jobs have been run. Most jobs ran for a few days. Results include proof that genetic algorithms can evolve directed and undirected graphs, development of a novel crossover operator for graphs, a paper in the journal Nanotechnology, and another paper in preparation.

Globus, Al↗
NASA NTRS2001

The radioresistance to killing of A1-5 cells derives from activation of the Chk1 pathway

Checkpoints respond to DNA damage by arresting the cell cycle to provide time for facilitating repair. In mammalian cells, the G(2) checkpoint prevents the Cdc25C phosphatase from removing inhibitory phosphate groups from the mitosis-promoting kinase Cdc2. Both Chk1 and Chk2, the checkpoint kinases, can phosphorylate Cdc25C and inactivate its in vitro phosphatase activity. Therefore, both Chk1 and Chk2 are thought to regulate the activation of the G(2) checkpoint. Here we report that A1-5, a transformed rat embryo fibroblast cell line, shows much more radioresistance associated with a much stronger G(2) arrest response when compared with its counterpart, B4, although A1-5 and B4 cells have a similar capacity for nonhomologous end-joining DNA repair. These phenotypes of A1-5 cells are accompanied by a higher Chk1 expression and a higher phosphorylation of Cdc2. On the other hand, Chk2 expression increases slightly following radiation; however, it has no difference between A1-5 and B4 cells. Caffeine or UCN-01 abolishes the extreme radioresistance with the strong G(2) arrest and at the same time reduces the phosphorylation of Cdc2 in A1-5 cells. In addition, Chk1 but not Chk2 antisense oligonucleotide sensitizes A1-5 cells to radiation-induced killing and reduces the G(2) arrest of the cells. Taken together these results suggest that the Chk1/Cdc25C/Cdc2 pathway is the major player for the radioresistance with G(2) arrest in A1-5 cells.

NASA Discipline Radiation Health↗
DOE OSTI2020

Metadata compression

A computer-executable method, system, and computer program product for managing a Parallel-Logged File System (PLFS) on a data storage system, wherein the data storage system is in communication with an application that updates the data storage system with checkpoint data, the computer-executable method, system, and computer program product comprising receiving a first checkpoint including data from the application; analyzing the data in the first checkpoint to determine whether a pattern exists in the checkpoint data; and upon a positive determination, adding the pattern into PLFS.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Shortwave‐Infrared‐Emitting Nanoprobes for CD8 Targeting and In Vivo Imaging of Cytotoxic T Cells in Breast Cancer

Checkpoint immunotherapy has made great strides in the treatment of solid tumors, but many patients do not respond to immune checkpoint inhibitors. Identification of tumor‐infiltrating cytotoxic T cells (CTLs) has the potential to stratify patients and monitor immunotherapy responses. In this study, the design of cluster of differentiation (CD8 + ) T cell‐targeted nanoprobes that emit shortwave infrared (SWIR) light in the second tissue‐transparent window for noninvasive, real‐time imaging of CTLs in murine models of breast cancer is presented. SWIR‐emitting rare‐earth nanoparticles encapsulated in human serum albumin are conjugated with anti‐CD8α to target CTLs with high specificity. CTL targeting is validated in vitro through binding of nanoprobes to primary mouse CTLs. The potential for the use of SWIR fluorescence intensity to determine CTL presence is validated in two syngeneic mammary fat pad tumor models, EMT6 and 4T1, which differ in immune infiltration. SWIR imaging using CD8‐targeted nanoprobes successfully identifies the presence of CTLs in the more immunogenic EMT6 model, while imaging confirms the lack of substantial immune infiltration in the nonimmunogenic 4T1 model. In this work, the opportunity for SWIR imaging using CD8‐targeted nanoprobes to assess CTL infiltration in tumors for the stratification and monitoring of responders to checkpoint immunotherapy is highlighted.

Shah, Jay V.↗
DOE OSTI2021

Current Status of Clinical Trials for Cervical and Uterine Cancer Using Immunotherapy Combined With Radiation

Novel therapies combined with radiation continue to be of significant interest in the developmental treatment paradigm of gynecologic cancers. Clinical implementation of immunotherapy in oncology has rapidly changed the treatment landscape, options, paradigm, and outcomes through clinical trials. Immunotherapy has emerged as a therapeutic pillar in the treatment of solid tumors with demonstrable synergistic activity when combined with radiation therapy and chemoradiotherapy by an alteration or enhancement of the immune system. In solid tumors, radiation therapy induces migration of dendritic cells, T cell activation, and proliferation, and increases in tumor-infiltrating lymphocytes. These immunomodulatory effects in conjunction with immune checkpoint blockade are currently under active investigation in the adjuvant, definitive, and metastatic settings. Results from early phase trials demonstrate promising efficacy and overall tolerable toxicity profiles of combined modality treatment. There is significant interest in optimizing the treatment for patients with locally advanced cervical cancer beyond the standard of care—chemoradiation—which has been in place for the last 30 years. The majority of cervical cancer emerges after persistent infection with a high-risk subtype of the human papillomavirus, where viral oncoproteins lead to cellular changes and immortalization. As a result, immune tolerance can develop, resulting in cancer. Knowledge of the mechanism of human papillomavirus–related oncogenesis suggests that immune therapy or checkpoint blockade can reinvigorate an antitumor immune response. Current clinical trials are exploring the therapeutic potential of these approaches. Uterine cancers have been grouped into 4 molecular subclasses by their driver mutations, mutational burden, and copy-number alterations. Of these subgroups, the polymerase epsilon–mutated and microsatellite-unstable may represent up to 40% of endometrial cancers, and they have been shown to be immunogenic. Because of the inherent immunogenicity of these MSI-high tumors, combined immune modulation strategies, including chemotherapy, radiation, and immunotherapy and immune checkpoint inhibitor therapy, are being explored to improve treatment outcomes. In this review, we explore current immunomodulatory and multimodality therapeutic approaches in the treatment of cervical and uterine cancer through ongoing clinical trials investigating the combination of immunotherapy and radiation therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
DOE OSTI2025

Graph-based Reversible Evaluation and Tangents Library

GRETL is a C++ library for evaluation, re-evaluation and algorithmic differentiation of functional operations on an arbitrary computational graph with limited memory usage. Similar to popular machine learning frameworks in Python, like PyTorch and JAX, it tracks and stores both operations and output data as functions are evaluated. Once this composition of functions is built up, the entire chain of operations can be back propagated to compute sensitivities of the final result with respect to any number of inputs. In contrast to most machine learning applications, memory usage becomes the bottleneck for back propagation in many physics applications, especially for time-dependent PDEs. Dynamic check pointing becomes essential. An important distinguishing feature of GRETL is its ability to limit the maximum memory usage by automatically dynamic checkpointing the data output for each graph operation (see Wang, Moin, Iaccarino, 2009). During backpropagation, parts of the graph that are no longer in memory are automatically re-evaluated from upstream checkpointed states as needed for derivative sensitivity calculations (or more precisely, for vector-Jacobian products). GRETL is particularly beneficial for applications, such as coupled multi-physics, where deriving adjoint-based sensitivities and managing checkpoint memory across modules becomes onerous. Cases which can be readily handled by the GRETL library include: different time-integration algorithms per physics (e.g., coupled predictor-corrector algorithms, IMEX, etc.), sub-cycling, asynchronous integrators, state dependent timestep sizes, iterative solvers and coupling algorithms, controller algorithms, and more.

Tupek, MichaelR [Lawrence Livermore National Labor↗
DOE OSTI2021

Resiliency in numerical algorithm design for extreme scale simulations

Here this work is based on the seminar titled ‘Resiliency in Numerical Algorithm Design for Extreme Scale Simulations’ held March 1–6, 2020, at Schloss Dagstuhl, that was attended by all the authors. Advanced supercomputing is characterized by very high computation speeds at the cost of involving an enormous amount of resources and costs. A typical large-scale computation running for 48 h on a system consuming 20 MW, as predicted for exascale systems, would consume a million kWh, corresponding to about 100k Euro in energy cost for executing 10 23 floating-point operations. It is clearly unacceptable to lose the whole computation if any of the several million parallel processes fails during the execution. Moreover, if a single operation suffers from a bit-flip error, should the whole computation be declared invalid? What about the notion of reproducibility itself: should this core paradigm of science be revised and refined for results that are obtained by large-scale simulation? Naive versions of conventional resilience techniques will not scale to the exascale regime: with a main memory footprint of tens of Petabytes, synchronously writing checkpoint data all the way to background storage at frequent intervals will create intolerable overheads in runtime and energy consumption. Forecasts show that the mean time between failures could be lower than the time to recover from such a checkpoint, so that large calculations at scale might not make any progress if robust alternatives are not investigated. More advanced resilience techniques must be devised. The key may lie in exploiting both advanced system features as well as specific application knowledge. Research will face two essential questions: (1) what are the reliability requirements for a particular computation and (2) how do we best design the algorithms and software to meet these requirements? While the analysis of use cases can help understand the particular reliability requirements, the construction of remedies is currently wide open. One avenue would be to refine and improve on system- or application-level checkpointing and rollback strategies in the case an error is detected. Developers might use fault notification interfaces and flexible runtime systems to respond to node failures in an application-dependent fashion. Novel numerical algorithms or more stochastic computational approaches may be required to meet accuracy requirements in the face of undetectable soft errors. These ideas constituted an essential topic of the seminar. The goal of this Dagstuhl Seminar was to bring together a diverse group of scientists with expertise in exascale computing to discuss novel ways to make applications resilient against detected and undetected faults. In particular, participants explored the role that algorithms and applications play in the holistic approach needed to tackle this challenge. This article gathers a broad range of perspectives on the role of algorithms, applications and systems in achieving resilience for extreme scale simulations. The ultimate goal is to spark novel ideas and encourage the development of concrete solutions for achieving such resilience holistically.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Checkpoint/Restart Vision and Strategies for NERSC’s Production Workloads

As a primary approach to fault-tolerant computing, Checkpoint/Restart (C/R) improves scientific productivity for users, provides scheduling flexibility for computing centers, and protects against system failures. While both applicationspecific (or application-level) and transparent C/R are used in practice, we are interested in transparent checkpointing, which is vital for system-level checkpointing. Developing and maintaining transparent C/R tools for HPC applications, however, is labor intensive and highly complex due to ever-changing HPC systems and diverse production workloads. Existing C/R tools are often research-oriented, so there is a gap to close before they can be used reliably with production workloads, especially on cutting edge HPC systems. In this position paper, we present our journey to prepare a production-ready MPI-Agnostic Network-Agnostic (MANA) transparent checkpointing tool for NERSC, and share our vision and strategies to bring transparent C/R capabilities to NERSC’s production workloads on current and future systems.

42 ENGINEERING↗
DOE OSTI2024

MAPSTER: Automated Geospatial Data Sharing – Version 1.4.0

The US Department of Energy’s (DOE) Oak Ridge National Laboratory (ORNL) developed MAPSTER which is a geospatial data management tool that aggregates, organizes, and shares data from dispersed sources such as unmanned aerial systems (UAS). Built specifically for use in environments where communications may be limited, MAPSTER utilizes two key technologies to effectively manage data in the field and enable easy data sharing with authorized partners: Observer and Checkpoint. Observer is a lightweight software package on an edge device, such as a laptop, that automatically detects newly processed UAS data and sends to a central server called Checkpoint. Checkpoint is a centralized server at ORNL that receives and manages data from all Observer instances. Even in a very low bandwidth environment, Observer can still send information about the UAS data product almost instantly as it generates its own metadata package on the size of KB (kilobytes). MAPSTER is not only for UAS data but for any geospatial data collected at the austere edge and dispersed sources.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1989

Cache-based error recovery for shared memory multiprocessor systems

A multiprocessor cache-based checkpointing and recovery scheme for of recovering from transient processor errors in a shared-memory multiprocessor with private caches is presented. New implementation techniques that use checkpoint identifiers and recovery stacks to reduce performance degradation in processor utilization during normal execution are examined. This cache-based checkpointing technique prevents rollback propagation, provides for rapid recovery, and can be integrated into standard cache coherence protocols. An analytical model is used to estimate the relative performance of the scheme during normal execution. Extensions that take error latency into account are presented.

Wu, Kun-Lung↗
NASA NTRS2011

Differential Processing of Low and High LET Radiation Induced DNA Damage: Investigation of Switch from ATM to ATR Signaling

The members of the phosphatidylinositol kinase-like kinase family of proteins namely ataxia-telangiectasia mutated (ATM) and ATM- and Rad3-related (ATR) are directly responsible for the maintenance of genomic integrity by mounting DDR through signaling and facilitating the recruitment of repair factors at the sites of DNA damage along with coordinating the deployment of cell cycle checkpoints to permit repair by phosphorylating Checkpoint kinase Chk1, Chk2 and p53. High LET radiation from GCR (Galactic Cosmic Rays) consisting mainly of protons and high energy and charged (HZE) particles from SPE (Solar Particle Event) pose a major health risk for astronauts on their space flight missions. The determination of these risks and the design of potential safeguards require sound knowledge of the biological consequences of lesion induction and the capability of the cells to counter them. We here strive to determine the coordination of ATM and ATR kinases at the break sites directly affecting checkpoint signaling and DNA repair and whether differential processing of breaks induced by low and high LET radiation leads to possible augmentation of swap of these damage sensors at the sites of DNA damage. Exposure of cells to IR triggers rapid autophosphorylation of serine-1981 that causes dimer dissociation and initiates monomer formation of ATM. ATM kinase activity depends on the disruption of the dimer, which allows access and phosphorylation of downstream ATM substrates like Chk2. Evidence suggests that ATM is activated by the alterations in higher-order chromatin structure although direct binding of ATM to DSB ends may be a crucial step in its activation. On the other hand, in case of ATR, RPA (replication protein A)-coated ssDNA (single-stranded DNA) generated as a result of stalled DNA replication or during processing of chromosomal lesions is crucial for the localization of ATR to sites of DNA damage in association with ATR-interacting protein (ATRIP). Although the majority of RPA-coated ssDNA is generally present only during DNA replication, ATR activation in G1 and G2-phase might still require formation of RPA-coated ssDNA, probably initiated by the MRN-CtIP complex and then extended by the Exo1- or BLM-dependent mechanisms at the sites of DSBs. Evidence accumulates that activation of ATM and ATR are oppositely regulated by the length of single stranded overhangs generated at the break sites by processes mentioned above and these stretches of single stranded overhangs hold the clue for ATM to ATR switch at broken DNA ends. We irradiated 82-6hTERT human fibroblast cells with low LET gamma-rays and high LET Fe and Si particles. Preliminary results with cells exposed to 1Gy gamma-rays show that the kinetics of pChk2-pT68 foci formation is comparable to that of gamma-H2AX although they appear to recede quicker. The number and intensity of observed foci reaches a maximum at 30 min and 60 min post IR for Chk2-pT68 and gamma-H2AX foci respectively and all Chk2-pT68 foci colocalize with gamma-H2AX foci. The kinetics of Chk1-pS345 and ATRIP are being determined. Results of Chk2-pT68 foci kinetics was also corroborated by western blot experiments, although phosphorylation was detected as early as 10 min and started receding 30 min post IR with 2Gy of gamma-rays. On the other hand, level of ATR-pS428 reached its maximum between 60 and 120 min and was maintained until the last measured time point of 4 hours post IR as determined by western blotting. Experiments performed with high LET Fe and Si particles will be reported.

Saha, Janapriya↗
DOE OSTI2022

DenKv: Addressing Design Trade-offs of Key-value Stores for Scientific Applications

High-performance computing (HPC) facilities have employed flash-based storage tier near to compute nodes to absorb high I/O demand by HPC applications during periodic system-level checkpoints. To accelerate these checkpoints, proxy-based distributed key-value stores (PD-KVS) gained particular attention for their flexibility to support multiple backends and different network configurations. PD-KVS rely internally on monolithic KVS, such as LevelDB or RocksDB, to exploit the KV interface and query support. However, PD-KVS are unaware of the high redundancy factor in checkpoint data, which can be up to GBs to TBs, and therefore, tend to generate high write and space amplification on these storage layers. In this paper, we propose DenKv which is deduplication-extended node-local LSM-tree-based KVS. DenKv employs asynchronous partially inline dedup (APID) and aims to maintain the performance characteristics of LSM-tree-based KVS while reducing the write and space amplification problems. We implemented DenKv atop BlobDB and showed that our proposed solution maintains performance while reducing write amplification up to 2× and space amplification by 4× on average.

Khan, Awais↗
DOE OSTI2021

PI3Kαδ Inhibitor Combined With Radiation Enhances the Antitumor Immune Effect of Anti-PD1 in a Syngeneic Murine Triple-Negative Breast Cancer Model

The poor response of breast cancer to immune checkpoint blockade might result from low immunogenicity and the immune-suppressive tumor microenvironment. We hypothesized that in situ tumor vaccination via radiation therapy (RT) and suppression of immune tolerance via phosphoinositide 3-kinase δ (PI3Kδ) inhibition would enhance the efficacy of immune checkpoint blockade.

62 RADIOLOGY AND NUCLEAR MEDICINE↗