Search NASA⌕ Search
Home/Archive/DOE OSTI

DOE OSTI · 2479926

UMap: An application-oriented user level memory mapping library

Peng, Ivy [Department of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden] (ORCID:0000000341583583)·Wahlgren, Jacob [Department of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden] (ORCID:0000000316697714)·Youssef, Karim [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000345449613)·Iwabuchi, Keita [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000293950843)·Pearce, Roger [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0009000064496568)·Gokhale, Maya [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000342295735)
View original source ↗Export metadata ↓

Abstract

Exploiting the prominent role of complex memories in exascale node architecture, the UMap page fault handler offers new capabilities to access large memory-mapped data sets directly. UMap provides flexible configuration options to customize page handling to each application, including analysis of massive observational and simulation data sets. The high-performance design features I/O decoupling, dynamic load balancing, and application-level controls. Page faults triggered by application threads and processes accessing data mapped to a UMapp’ed region are handled via the Linux userfaultfd protocol, an asynchronous message-oriented kernel-user communication mechanism that avoids the context switch penalty of traditional signal fault handlers. UMap is fully open source. In this paper, we give an overview of the UMap library architecture, its extensible plugin architecture, and the use/performance of UMap in emerging heterogeneous memory hierarchies such as near-node Non-volatile Memory (NVM) and network attached memories. We highlight new capabilities in two pagefault management plugins, the NetworkStore and SparseStore. We demonstrate the integration between UMap and multiple ECP products including Caliper, Metall, ZFP, Mochi, and Ripples.

Explore related subjects

97 MATHEMATICS AND COMPUTINGComputer sciencecomputer science

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng, Ivy [Department of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden] (ORCID:0000000341583583), Wahlgren, Jacob [Department of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden] (ORCID:0000000316697714), Youssef, Karim [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000345449613), Iwabuchi, Keita [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000293950843), Pearce, Roger [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0009000064496568), Gokhale, Maya [Center for Applied Scientific Computing, Lawrence Livermore National Laboratory, Livermore, CA, USA] (ORCID:0000000342295735). 2024-12-05. UMap: An application-oriented user level memory mapping library. https://doi.org/10.1177/10943420241303145

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

DOE OSTI2026

TANTE: Time-adaptive operator learning via neural Taylor expansion

Operator learning for time-dependent partial differential equations (PDEs) has seen rapid progress in recent years, enabling efficient approximation of complex spatiotemporal dynamics. However, most existing methods rely on fixed time step sizes during rollout, which limits their ability to adapt to varying temporal complexity and often leads to error accumulation. In this work, we propose the Time-Adaptive Transformer with Neural Taylor Expansion (TANTE), a novel operator-learning framework that produces continuous-time predictions with adaptive step sizes. TANTE predicts future states by performing a Taylor expansion at the current state, where neural networks learn both the higher-order temporal derivatives and the local radius of convergence. This allows the model to dynamically adjust its rollout based on the local behavior of the solution, thereby reducing cumulative error and improving computational efficiency. We demonstrate the effectiveness of TANTE across a wide range of PDE benchmarks, achieving superior accuracy and adaptability compared to fixed-step baselines, delivering accuracy gains of 60-80 % and speed-ups of 30-40 % at inference time.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Structured illumination for surface-resolved grazing-incidence X-ray scattering

Grazing-incidence (GI) scattering techniques are widely used to characterize thin films, offering high surface sensitivity and insight into morphology and structure. However, these approaches typically provide statistical averaged information due to elongated footprint or limited spatial resolution due to beam size. Here we introduce a method that combines structured illumination with GI X-ray scattering and leverages our computational imaging approach to resolve local structural details. We demonstrate that our method captures local features of an organic semiconductor thin film without the need for sample rotation as in tomography. The method expands GI techniques from statistical averaging to high-resolution imaging, thereby providing the capability for detailed analysis of local material properties, such as domain shape, orientation and polymorphism, which are critical for advancing material design towards more efficient and tailored materials.

97 MATHEMATICS AND COMPUTING↗