Xingfu Wu

Xingfu Wu

Auto-generated profile, based on publicly available information

Xingfu Wu

Mathematics & Computer Science Division Argonne National Laboratory Lemont Illinois USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
8 November 2021 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
XWXingfu Wu
Xingfu Wu
MKMichael Kruse
Michael Kruse
PBPrasanna Balaprakash
Prasanna Balaprakash
HFHal Finkel
Hal Finkel
PHPaul Hovland
Paul Hovland
MHMary Hall
Mary Hall

30 October 2024 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Open access
XWXingfu Wu
Xingfu Wu
PBPrasanna Balaprakash
Prasanna Balaprakash
MKMichael Kruse
Michael Kruse
JKJaehoon Koo
Jaehoon Koo
BVBrice Videau
Brice Videau
MHMary Hall
Mary Hall
As we enter the exascale computing era, efficiently utilizing power and optimizing the performance of scientific applications under power and energy constraints has become critical and challenging. We propose a low‐overhead autotuning framework to autotune performance and energy for various hybrid MPI/OpenMP scientific applications at large scales and to explore the tradeoffs between application runtime and power/energy for energy efficient application execution, then use this framework to autotune four ECP proxy applications—XSBench, AMG, SWFFT, and SW4lite. Our approach uses Bayesian optimization with a Random Forest surrogate model to effectively search parameter spaces with up to 6 million different configurations on two large‐scale HPC production systems, Theta at Argonne National Laboratory and Summit at Oak Ridge National Laboratory. The experimental results show that our autotuning framework at large scales has low overhead and achieves good scalability. Using the proposed autotuning framework to identify the best configurations, we achieve up to 91.59% performance improvement, up to 21.2% energy savings, and up to 37.84% EDP (energy delay product) improvement on up to 4096 nodes.

1 May 2016
Verified
Conference Paper
Closed access
XWXingfu Wu
Xingfu Wu
VTValerie Taylor
Valerie Taylor
Hardware performance counters are used as effective proxies to estimate power consumption and runtime. In this paper we present a performance counter-based power and performance modeling and optimization method, and use the method to model four metrics: runtime, system power, CPU power and memory power. The performance counters that compose the models are used to explore some counter-guided optimizations with two large-scale scientific applications: an earthquake simulation and an aerospace application. We demonstrate the use of the method using two power-aware supercomputers, Mira at Argonne National Laboratory and SystemG at Virginia Tech. The counter-guided optimizations result in a reduction in energy by an average of 18.28% on up to 32,768 cores on Mira and 11.28% on up to 128 cores on SystemG for the aerospace application. For the earthquake simulation, the average energy reductions achieved are 48.65% on up to 4,096 cores on Mira and 30.67% on up to 256 cores on SystemG.

12 November 2023
Verified
Conference Paper
Open access
XWXingfu Wu
Xingfu Wu
PPPraveen Paramasivam
Praveen Paramasivam
VTValerie Taylor
Valerie Taylor
Apache TVM (Tensor Virtual Machine), an open source machine learning compiler framework designed to optimize computations across various hardware platforms, provides an opportunity to improve the performance of dense matrix factorizations such as LU (Lower Upper) decomposition and Cholesky decomposition on GPUs, FPGAs, ASICs, and AI accelerators. In this paper, we propose a new TVM autotuning framework using Bayesian Optimization and use the TVM tensor expression language to implement linear algebra kernels such as LU, Cholesky, and 3mm. We use these scientific computation kernels to evaluate the effectiveness of our methods on a GPU cluster, called Swing, at Argonne National Laboratory. We compare the proposed autotuning framework with the TVM autotuning framework AutoTVM with four tuners and find that our framework outperforms AutoTVM in most cases.

5 August 2022 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
XWXingfu Wu
Xingfu Wu
VTValerie Taylor
Valerie Taylor
ZLZhiling Lan
Zhiling Lan

21 June 2023
Verified
Conference Paper
Open access
TRThomas Randall
Thomas Randall
JKJaehoon Koo
Jaehoon Koo
BVBrice Videau
Brice Videau
MKMichael Kruse
Michael Kruse
XWXingfu Wu
Xingfu Wu
PBPrasanna Balaprakash
Prasanna Balaprakash
As diverse high-performance computing (HPC) systems are built, many opportunities arise for applications to solve larger problems than ever before. Given the significantly increased complexity of these HPC systems and application tuning, empirical performance tuning, such as autotuning, has emerged as a promising approach in recent years. Despite its effectiveness, autotuning is often a computationally expensive approach. Transfer learning (TL)-based autotuning seeks to address this issue by leveraging the data from prior tuning. Current TL methods for autotuning spend significant time modeling the relationship between parameter configurations and performance, which is ineffective for few-shot (that is, few empirical evaluations) tuning on new tasks. We introduce the first generative TL-based autotuning approach based on the Gaussian copula (GC) to model the high-performing regions of the search space from prior data and then generate high-performing configurations for new tasks. This allows a sampling-based approach that maximizes few-shot performance and provides the first probabilistic estimation of the few-shot budget for effective TL-based autotuning. We compare our generative TL approach with state-of-the-art autotuning techniques on several benchmarks. We find that the GC is capable of achieving 64.37% of peak few-shot performance in its first evaluation. Furthermore, the GC model can determine a few-shot transfer budget that yields up to 33.39× speedup, a dramatic improvement over the 20.58× speedup using prior techniques.