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 55 records · Page 3
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 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↗
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 OSTI2025

Aviation Security Screening Optimizer for Risk and ThroughputASSORT

The Aviation Security Screening Optimizer for Risk and Throughput (ASSORT) is designed to assess risk-based approaches for passenger screening and checkpoint operations. Additionally, ASSORT is exploring various traveler categories — general, trusted, and trusted-plus — along with different checkpoint screening Concept of Operations tailored to each traveler type

Brigantic, Robert [Pacific Northwest National Labo↗
DOE OSTI2025

BULKI-Store v0.3.2

BULKI-Store is a distributed object storage system optimized for high-performance computing environments. Built with a Rust core and Python bindings, it efficiently manages scientific and machine learning datasets across HPC clusters. The system employs a client-server architecture with MPI integration, enabling seamless scaling on supercomputers like Perlmutter. BULKI-Store's object-oriented approach provides intuitive data organization with rich metadata support, contrasting with traditional file-based solutions. Key optimizations include selective checkpoint loading, unified checkpoint files, and object chunking for large data transfers. For machine learning workloads, BULKI-Store offers advantages through fine-grained access patterns, dynamic data sharing between training instances, and reduced memory pressure. Memory management features include strategic Python GC calls, minimized data copies, and batch processing capabilities. The system leverages Rayon's thread pool for asynchronous data prefetching and supports multiple CPU architectures (ARM64, x86, AMD, RISC-V). By combining performance optimizations with developer-friendly APIs, BULKI-Store addresses the complex data management challenges of modern HPC applications while maintaining compatibility across heterogeneous computing environments.

Zhang, Wei [Lawrence Berkeley National Laboratory ↗
DOE OSTI2026

HydraGNN_Predictive_GFM_2026 - Ensemble of predictive graph foundation models for atomistic materials modeling

This release contains data and parameters of HydraGNN-based graph foundation models trained as a result of the work published in the pre-print "Exascale Multi-Task Graph Foundation Models for Imbalanced, Multi-Fidelity Atomistic Data" by M. Lupo Pasini et al. (https://arxiv.org/abs/2604.15380). We jointly train on 16 open first-principles datasets (544+ million structures covering 85+ elements) using a multi-task architecture with per-dataset heads and a scalable ADIOS2/DDStore data pipeline. On Frontier, we execute six large-scale DeepHyper hyperparameter optimization campaigns in FP64 and promote the top-performing message-passing models to sustained 2,048-node training, yielding a PaiNN-based lead model. The version of HydraGNN used to generate the outputs provided in this release is HydraGNN v5.0 (https://github.com/ORNL/HydraGNN/releases/tag/v5.0) The list of datasets used for the training of the graph foundation model is the following: 1) Alexandria [1] 2) ANI1x [2] 3) MPTrj [3] 4) Open Catalyst 2020 (OC20) [4] 5) Open Catalyst 2022 (OC22) [5] 6) Open Catalyst 2025 (OC25) [6] 7) Open Direct ir Capture 2023 (ODAC23) [7] 8) Open Materials 2024 (OMat24) [8] 9) Open Molecules 2025 (OMol25) [9] 10) OMol25-neutral (subset of OMol25 that contains only molecules with zero total charge) 11) OMol25-non-neutral (subset of OMol25 that contains only molecules with non-zero total charge) 12) Open Polymers 2026 (OPoly2026) [10] 13) Nabla2DFT [11] 14) QCML [12] 15) QM7X [reference 13] 16) transition1x [14] Dataset references: [1] J. Schmidt et al., “A dataset of 175k stable and metastable materials calculated with the PBEsol and SCAN functionals,” Scientific Data, vol. 9, p. 64, 2022. [2] J. S. Smith et al., “The ANI-1ccx and ANI-1x data sets, coupled-cluster and density functional theory properties for molecules,” Scientific Data, vol. 7, p. 134, 2020. [Online]. Available: https: //www.nature.com/articles/s41597-020-0473-z [3] A. Jain et al., “Commentary: The Materials Project: A materials genome approach to accelerating materials innovation,” APL Materials, vol. 1, no. 1, p. 011002, 07 2013. [Online]. Available: https://doi.org/10.1063/1.4812323 [4] L. Chanussot et al., “Open catalyst 2020 (oc20) dataset and community challenges,” ACS Catalysis, vol. 11, no. 10, pp. 6059–6072, 2021. [Online]. Available: https://doi.org/10.1021/acscatal.0c04525 [5] K. Tran et al., “Open catalyst 2022 (oc22) dataset and challenges for oxidation electrocatalysts,” ACS Catalysis, vol. 13, no. 5, pp. 3066–3084, 2023. [Online]. Available: https://doi.org/10.1021/acscatal.2c05426 [6] S. J. Sahoo et al., “The open catalyst 2025 (oc25) dataset and models for solid-liquid interfaces,” arXiv preprint arXiv:2509.17862, 2025. [Online]. Available: https://arxiv.org/abs/2509.17862 [7] A. Sriram et al., “The open DAC 2023 dataset and challenges for sorbent discovery in direct air capture,” ACS Central Science, vol. 10, no. 5, pp. 923–941, 2024. [8] L. Barroso-Luque et al., “Open materials 2024 (omat24) inorganic materials dataset and models,” 2024. [Online]. Available: https://arxiv.org/abs/2410.12771 [9] D. S. Levine et al., “The open molecules 2025 (OMol25) dataset, evaluations, and models,” 2025. [Online]. Available: https://arxiv.org/abs/2505.08762 [10] D. S. Levine et al., The open polymers 2026 (OPoly26) dataset and evaluations,” arXiv preprint arXiv:2512.23117, 2025. [Online]. Available: https://arxiv.org/abs/2512.23117 [11] K. Khrabrov et al., “Nabla2dft: A universal quantum chemistry dataset of drug-like molecules and a benchmark for neural network potentials,” in NeurIPS 2024 Datasets and Benchmarks Track, 2024. [Online]. Available: https://openreview.net/forum?id=ElUrNM9U8c [12] S. Ganscha et al., “The QCML dataset, quantum chemistry reference data from 33.5M DFT and 14.7B semi-empirical calculations,” Scientific Data, vol. 12, p. 406, 2025. [13] J. Hoja et al., “QM7-X, a comprehensive dataset of quantum-mechanical properties spanning the chemical space of small organic molecules,” Scientific Data, vol. 8, p. 43, 2021. [Online]. Available: https://www.nature.com/articles/s41597-021-00812-2 [14] M. Schreiner et al., “Transition1x - a dataset for building generalizable reactive machine learning potentials,” Scientific Data, vol. 9, p. 779, 2022. The folder "datasets_ADIOS2_format" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "datasets_ADIOS2_format" directory contains 2 sub-directories, one for the version "v1" of the datasets and one for the version "v2" of the datasets. The version "v1" of the datasets provides values of the total energy as they are extracted from the original data as it was released by the respective institutions. The version "v2" of the datasets provides values of the energy that have been realigned. The realignment was performed by training a linear regression model that predicts the total energy as a function of the chemical composition of the atomistic structure, and then subtract such prediction from the original value of the total energy. Both folders "v1" and "v2" contain 16 sub-directories, each corresponding to an ADIOS2-formatted dataset The folder "DeepHyper-results" contains the configurational files and model's parameters for all the 186 HPO trials that were successfully completed by the scalable hyperparameter optimization (HPO) runs on Frontier. The content of the folder "DeepHyper-results" I structured as follows: 1) task-list.txt: list of mpnn name, jobid, and deephyper task id 2) gfm_${MPNN}_${JOBID}_0.${TASKID}: run directory with checkpoint files 3) gfm_${MPNN}: deephyper summary directory (*.csv) for each specific MPNN type 4) deephyper-experiment-${JOBID}: output and error logs for each job The file "deephyper-sorted.csv" contains the details of each HydraGNN model built and tested by HPO, obtained by merging the (*.csv) filed from each HPO run executed. Out of all the HPO trials, we selected 10 to continue the training of the respective HydraGNN models. Due to limited computational budget available in the LRN070 allocation we could not complete the training till convergence for all these 10 selected models. The folder "models" contains multiple sub-folders, one per each HydraGNN model trained. Each model sub-folder contains the parameters of each HydraGNN model, with multiple checkpoint-restarts. The list of sub-folders are as follows: 1) multidataset_hpo-BEST1-fp64 2) multidataset_hpo-BEST2-fp64 3) multidataset_hpo-BEST3-fp64 4) multidataset_hpo-BEST4-fp64 5) multidataset_hpo-BEST5-fp64 6) multidataset_hpo-BEST6-fp64 7) multidataset_hpo-BEST7-fp64 8) multidataset_hpo-BEST8-fp64 9) multidataset_hpo-BEST9-fp64 10) multidataset_hpo-BEST10-fp64 Within each one of these folders, additional auxiliary log files are provided with descriptions about how the training proceeded. The lead PaiNN-model is contained inside "multidataset_hpo-BEST6-fp64". The file "mlp_branch_weights" contains the parameters of the multi-layer perceptron (MLP) used to reconcile the predictions of the 16 output decoding heads of the HydragNN architectures. The MLP takes in input the chemical composition of the atomistic structure and predicts averaging weights to linearly mix the predictions of each output decoding head toward consolidating them into a single one. The folder "1.1billion-structure-inference" contains 1.1 billion atomistic structures randomly generated. Each structures is associated with energy and forces predicted with the lead-PaiNN model combined with the MLP model for reconciliation of the multi-branch predictions generated by the 16 output decoding heads. The folder "1.1billion-structure-inference" contains 9,300 (*.tar.gz) subdirectories, one per Frontier compute node used to execute the inference at exascale. Once uncompressed, each (*.tar.gz) subdirectory contains an ADIOS2 (*.bp) file container, where each atomistic structure is stored as a PyTorch-Geometric Data object. The file "export_dataset_environment_variables.sh" contains the environment variables that need to be set before running the HydraGNN code to reproduce the results provided in this dataset release. The code that can be used to load the ADIOS2 files, load HydraGNN models, and run inference is available at: https://github.com/ORNL/HydraGNN/releases/tag/v5.0

36 MATERIALS SCIENCE↗
DOE OSTI2026

HydraGNN_OPF_GFM_2026 - Ensemble of predictive graph foundation models for power grid applications

This dataset supports research on graph foundation models for optimal power flow (OPF) on electric grids using HydraGNN. It contains heterogeneous graph representations of PGLib-OPF cases spanning systems from 14 to 13,659 buses, together with packed HDF5 datasets for pretraining, feasibility classification, and N-1 contingency analysis. The release includes OPF solution data, downstream fine-tuning datasets, pretrained HeteroSAGE and HeteroHEAT model checkpoints, hyperparameter-optimization summaries across multiple heterogeneous GNN architectures, and aggregated fine-tuning results for sample-efficiency studies. The dataset is designed to enable scalable training, evaluation, and transfer-learning studies for OPF surrogate modeling, including node-level AC-OPF solution prediction, graph-level prediction, feasibility classification, operating-condition generalization, and contingency-response tasks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A bespoke model of Arctic river basins based on hillslope delineation: Model Archive

This dataset is a model archive of the paper A bespoke model of Arctic river basins based on hillslope delineation (in prep), which introduces a watershed decomposition and parameterization method for large scale permafrost hydrology simulation. With this dataset, this study aims to address the research question: whether a computationally efficient hillslope-based modeling framework can reliably simulate discharge at Arctic river-basin scales. This dataset contains model input and output data for five modeling scenarios at a study site located in the Sagavanirktok River basin. The five modeling scenarios include three modeling cases under temperate conditions using full 3D, decomposed 3D, and decomposed 2D modeling strategies; and two modeling cases under actual Arctic conditions with permafrost using full 3D and decomposed 2D modeling strategies. Simulations were performed using the Advanced Terrestrial Simulator (ATS, v1.6 for three temperate scenarios and v1.5 for two Arctic scenarios), a physics-rich integrated surface–subsurface hydrologic model with cryo-hydrology features. For the three temperate models, simulations were conducted for the period of 10/01/1993 - 09/30/2002; and for the two Arctic models, simulations were conducted for the period of 01/01/1994 - 12/31/2002. To facilitate reproducibility of simulations, all datasets are organized hierarchically. The dataset contains: (1) Mesh files (.exo) for full 3D model, decomposed 3D models, and decomposed 2D models, located in huc/190604020802_gauge15906000/mesh/. Mesh files can be visualized through Paraview or read by Python. (2) Climate forcings (.h5) for full 3D model and decomposed 3D/2D models are located in huc/190604020802_gauge15906000/daymet_onePiece/, and huc/190604020802_gauge15906000/vp_pr_revised_daymet_1980_2006_with_wind/ separately. Accessible by Python. (3) Raw measured gage discharge (.csv) from USGS, located in huc/190604020802_gauge15906000/gaged_basin15906000_discharge_usgs/. Accessible by Python. (4) Delineated subdomain raster (.tif) and shape files (.shp), and the final parameterized results (.npy) for decomposed models, located in huc/190604020802_gauge15906000/data_preprocessed-meshing. Accessible by Python. (5) Temperate models are located in nonpermaf_huc190604020802_gauge15906000/, which includes three cases: decomposed 2D models (inside model_0*-hillslope_*), decomposed 3D models (inside model_1*-subcatchment_*), and full 3D model (inside model_2*-onepiece_*). Two step spin-up results (checkpoint_final.h5) are located in model_*1-*_spinup_steadystate and model_*2-*_spinup_cycle, separately, which are used to initialize real transient models. The input files (.xml) and output results (.dat) of the real transient models are located in model_*3-*_transient/. Especially, for two example hillslope models (ID=-11 and 11), additional h5py files are included in model_03-hillslope_transient/hillslope-11/, model_03-hillslope_transient/hillslope11, model_13-subcatchment_transient/subcatchment-11/, model_13-subcatchment_transient/subcatchment/11, respectively, which are used to plot the saturation figure (Figure 5) in the manuscript. Accessible by Python. (6) Arctic models are located in huc190604020802_gauge15906000/, which includes two cases: decomposed 2D models (inside model_04-hillslope_transient), and full 3D model (inside model_05-onepiece_transient_mannp1_ra). Three step spin-up results (checkpoint_final.h5) are located in model_01-column_freezeup/, model_02-column_spinup/, model_03-hillslope_spinup/, respectively, which are used to initialize real 2D transient hillslope models. The input files (.xml) and output results (.dat) of transient 2D hillslope models are located in model_04-hillslope_transient/. The input files (.xml) and output results (.dat) of the full 3D transient model is located in model_05-onepiece_transient_mannp1_ra/. The full 3D transient model is initialized by model_02-column_spinup/. Accessible by Python. (7) The MOSART routed discharge results (.csv) under Arctic conditions is located in huc190604020802_gauge15906000/MOSART/. Accessible by Python. (8) All Python codes (.py) used to parameterize full 3D model to decomposed 2D models are located in script/. These codes fit with watershed workflow (a watershed delineation tool) v1.4 under the branch gaob/v1.4 from https://github.com/gaobhub/watershed-workflow.git.

EARTH SCIENCE > CRYOSPHERE↗
NASA NTRS1978

On the append and continue features in NASTRAN

The APPEND feature is described which is applicable in the case of real eigenvalue analysis. This feature permitted the addition of new eigenvalues and eigenvectors to those already computed in a previously checkpointed run without re-executing the entire problem. The next feature was the CONTINUE feature which was applicable in the case of transient analysis of coupled equations. This feature enabled the integration of coupled equations to be continued beyond the last output time for which the solution was obtained in a previously checkpointed run (without re-executing the entire problem). These two features are illustrated by suitable examples.

Pamidi, P. R.↗
NASA NTRS1991

Memory management and compiler support for rapid recovery from failures in computer systems

This paper describes recent developments in the use of memory management and compiler technology to support rapid recovery from failures in computer systems. The techniques described include cache coherence protocols for user transparent checkpointing in multiprocessor systems, compiler-based checkpoint placement, compiler-based code modification for multiple instruction retry, and forward recovery in distributed systems utilizing optimistic execution.

Fuchs, W. K.↗
NASA NTRS1992

Scheduling message processing for reducing rollback propagation

Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.

Wang, Yi-Min↗
NASA NTRS1995

Ensuring correct rollback recovery in distributed shared memory systems

Distributed shared memory (DSM) implemented on a cluster of workstations is an increasingly attractive platform for executing parallel scientific applications. Checkpointing and rollback techniques can be used in such a system to allow the computation to progress in spite of the temporary failure of one or more processing nodes. This paper presents the design of an independent checkpointing method for DSM that takes advantage of DSM's specific properties to reduce error-free and rollback overhead. The scheme reduces the dependencies that need to be considered for correct rollback to those resulting from transfers of pages. Furthermore, in-transit messages can be recovered without the use of logging. We extend the scheme to a DSM implementation using lazy release consistency, where the frequency of dependencies is further reduced.

Janssens, Bob↗