Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “locality”

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 433 records · Page 24
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Local Observation of the Site Occupancy of Mn in a MnFePSi Compound

MnFePSi compounds are promising materials for magnetic refrigeration as they exhibit a giant magnetocaloric effect. From first principles calculations and experiments on bulk materials, it has been proposed that this is due to the Mn and Fe atoms preferentially occupying two different sites within the atomic lattice. A recently developed technique was used to deconvolve the obscuring effects of both multiple elastic scattering and thermal diffuse scattering of the probe in an atomic resolution electron energy-loss spectroscopy investigation of a MnFePSi compound. This reveals, unambiguously, that the Mn atoms preferentially occupy the 3g site in a hexagonal crystal structure, confirming the theoretical predictions. After deconvolution, the data exhibit a difference in the Fe L 2,3 ratio between the 3f and 3g sites consistent with differences in magnetic moments calculated from first principles, which are also not observed in the raw data.

36 MATERIALS SCIENCE↗
DOE OSTI2014

Lazy Checkpointing: Exploiting Temporal Locality in Failures to Mitigate Checkpointing Overheads on Extreme-Scale Systems, In: 2014 44th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Continuing increase in the computational power of supercomputers has enabled large-scale scientific applications in the areas of astrophysics, fusion, climate and combustion to run larger and longer-running simulations, facilitating deeper scientific insights. However, these long-running simulations are often interrupted by multiple system failures. Therefore, these applications rely on "check pointing'" as a resilience mechanism to store application state to permanent storage and recover from failures. Unfortunately, check pointing incurs excessive I/O overhead on supercomputers due to large size of checkpoints, resulting in a sub-optimal performance and resource utilization. In this paper, we devise novel mechanisms to show how check pointing overhead can be mitigated significantly by exploiting the temporal characteristics of system failures. We provide new insights and detailed quantitative understanding of the check pointing overheads and trade-offs on large-scale machines. Our prototype implementation shows the viability of our approach on extreme-scale machines.

Computer Science↗