James Ahrens

James Ahrens

Auto-generated profile, based on publicly available information

James Ahrens

Los Alamos National Laboratory

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
2 July 2016 in Technometrics
Verified
Journal Article
Closed access
KMKary Myers
Kary Myers
ELEarl Lawrence
Earl Lawrence
MFMichael Fugate
Michael Fugate
CBClaire McKay Bowen
Claire McKay Bowen
LTLawrence Ticknor
Lawrence Ticknor
JAJim Ahrens
Jim Ahrens
As computer simulations continue to grow in size and complexity, they present a particularly challenging class of big data problems. Many application areas are moving toward exascale computing systems, systems that perform 1018 FLOPS (FLoating-point Operations Per Second)—a billion billion calculations per second. Simulations at this scale can generate output that exceeds both the storage capacity and the bandwidth available for transfer to storage, making post-processing and analysis challenging. One approach is to embed some analyses in the simulation while the simulation is running—a strategy often called in situ analysis—to reduce the need for transfer to storage. Another strategy is to save only a reduced set of time steps rather than the full simulation. Typically the selected time steps are evenly spaced, where the spacing can be defined by the budget for storage and transfer. This article combines these two ideas to introduce an online in situ method for identifying a reduced set of time steps of the simulation to save. Our approach significantly reduces the data transfer and storage requirements, and it provides improved fidelity to the simulation to facilitate post-processing and reconstruction. We illustrate the method using a computer simulation that supported NASA's 2009 Lunar Crater Observation and Sensing Satellite mission.

16 July 2019 in Entropy
Verified
Journal Article
Open access
PDF file
Soumya DuttaSoumya Dutta
Soumya Dutta
ABAyan Biswas
Ayan Biswas
JAJames Ahrens
James Ahrens
With increasing computing capabilities of modern supercomputers, the size of the data generated from the scientific simulations is growing rapidly. As a result, application scientists need effective data summarization techniques that can reduce large-scale multivariate spatiotemporal data sets while preserving the important data properties so that the reduced data can answer domain-specific queries involving multiple variables with sufficient accuracy. While analyzing complex scientific events, domain experts often analyze and visualize two or more variables together to obtain a better understanding of the characteristics of the data features. Therefore, data summarization techniques are required to analyze multi-variable relationships in detail and then perform data reduction such that the important features involving multiple variables are preserved in the reduced data. To achieve this, in this work, we propose a data sub-sampling algorithm for performing statistical data summarization that leverages pointwise information theoretic measures to quantify the statistical association of data points considering multiple variables and generates a sub-sampled data that preserves the statistical association among multi-variables. Using such reduced sampled data, we show that multivariate feature query and analysis can be done effectively. The efficacy of the proposed multivariate association driven sampling algorithm is presented by applying it on several scientific data sets.

1 November 2019 in IEEE Transactions on Visualization and Computer Graphics
Verified
Journal Article
Closed access
HCHamish A. Carr
Hamish A. Carr
GWGunther H. Weber
Gunther H. Weber
CSChristopher M. Sewell
Christopher M. Sewell
OROliver Rubel
Oliver Rubel
PFPatricia Fasel
Patricia Fasel
JAJames P. Ahrens
James P. Ahrens
As data sets grow to exascale, automated data analysis and visualization are increasingly important, to intermediate human understanding and to reduce demands on disk storage via in situ analysis. Trends in architecture of high performance computing systems necessitate analysis algorithms to make effective use of combinations of massively multicore and distributed systems. One of the principal analytic tools is the contour tree, which analyses relationships between contours to identify features of more than local importance. Unfortunately, the predominant algorithms for computing the contour tree are explicitly serial, and founded on serial metaphors, which has limited the scalability of this form of analysis. While there is some work on distributed contour tree computation, and separately on hybrid GPU-CPU computation, there is no efficient algorithm with strong formal guarantees on performance allied with fast practical performance. We report the first shared SMP algorithm for fully parallel contour tree computation, with formal guarantees of O(lg V lgt) parallel steps and O(V lg V) work for data with V samples and t contour tree supernodes, and implementations with more than 30× parallel speed up on both CPU using TBB and GPU using Thrust and up 70× speed up compared to the serial sweep and merge algorithm.

11 March 2014 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
YSYu Su
Yu Su
GAGagan Agrawal
Gagan Agrawal
JWJonathan Woodring
Jonathan Woodring
KMKary Myers
Kary Myers
JWJoanne Wendelberger
Joanne Wendelberger
JAJames Ahrens
James Ahrens

6 December 2023 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
DWDaoce Wang
Daoce Wang
JPJesus Pulido
Jesus Pulido
PGPascal Grosset
Pascal Grosset
SJSian Jin
Sian Jin
JTJiannan Tian
Jiannan Tian
DTDingwen Tao
Dingwen Tao
Today's scientific simulations require significant data volume reduction because of the enormous amounts of data produced and the limited I/O bandwidth and storage space. Error-bounded lossy compression has been considered one of the most effective solutions to the above problem. However, little work has been done to improve error-bounded lossy compression for Adaptive Mesh Refinement (AMR) simulation data. Unlike the previous work that only leverages 1D compression, in this work, we propose an approach ( TAC ) to leverage high-dimensional SZ compression for each refinement level of AMR data. To remove the data redundancy across different levels, we propose several pre-process strategies and adaptively use them based on the data features. We further optimize TAC to TAC+ by improving the lossless encoding stage of SZ compression to handle many small AMR data blocks after the pre-processing efficiently. Experiments on 10 AMR datasets from three real-world large-scale AMR simulations demonstrate that TAC+ can improve the compression ratio by up to 4.9× under the same data distortion, compared to the state-of-the-art method. In addition, we leverage the flexibility of our approach to tune the error bound for each level, which achieves much lower data distortion on two application-specific metrics.

16 November 2009
Verified
Conference Paper
Open access
JAJames P. Ahrens
James P. Ahrens
JWJonathan Woodring
Jonathan Woodring
DDDavid E. DeMarle
David E. DeMarle
JPJohn Patchett
John Patchett
MMMathew Maltrud
Mathew Maltrud