VLDB 2026 Research / reviewers in the wild / expert
Luke Shulenburger
dblp:35/10792
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-7165-084XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Emerging computing paradigms · 44% Performance modeling and evaluation · 44% Energy-efficient computing · 13% |
Topics — the 1 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Emerging computing paradigms › quantum computing › quantum simulation
quantum monte carlo simulation |
0.3 | 1 | 2017 | Embracing a new era of highly efficient and productive quantum Monte Carlo simulations · SC 2017 |
Methods — techniques the papers use, named apart from their topics
vectorization · 0.3structure-of-arrays layout · 0.3single-precision computation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Optimization and Parallelization of B-Spline Based Orbital Evaluations in QMC on Multi/Many-Core Shared Memory ProcessorsabstractB-spline based orbital representations are widely used in Quantum Monte Carlo (QMC) simulations of solids, historically taking as much as 50% of the total run time. Random accesses to a large four-dimensional array make it challenging to efficiently utilize caches and wide vector units of modern CPUs. We present node-level optimizations of B-spline evaluations on multi/many-core shared memory processors. To increase SIMD efficiency and bandwidth utilization, we first apply data layout transformation from array-of-structures to structure-of-arrays (SoA). Then by blocking SoA objects, we optimize cache reuse and get sustained throughput for a range of problem sizes. We implement efficient nested threading in B-spline orbital evaluation kernels, paving the way towards enabling strong scaling of QMC simulations. These optimizations are portable on four distinct cache-coherent architectures and result in up to 5.6x performance enhancements on Intel®Xeon PhiTM processor 7250P (KNL), 5.7x on Intel®Xeon PhiTM coprocessor 7120P, 10x on an Intel®Xeon®processor E5v4 CPU and 9.5x on BlueGene/Q processor. Our nested threading implementation shows nearly ideal parallel efficiency on KNL up to 16 threads. We employ roofline performance analysis to model the impacts of our optimizations. This work combined with our current efforts of optimizing other QMC kernels, result in greater than 4.5x speedup of miniQMC on KNL. Amrita Mathuriya, Ye Luo 0001, Anouar Benali, Luke Shulenburger, Jeongnim Kim |
IPDPS | 4 |
| 2017 | Embracing a new era of highly efficient and productive quantum Monte Carlo simulationsabstractQMCPACK has enabled cutting-edge materials research on supercomputers for over a decade. It scales nearly ideally but has low single-node efficiency due to the physics-based abstractions using array-of-structures objects, causing inefficient vectorization. We present a systematic approach to transform QMCPACK to better exploit the new hardware features of modern CPUs in portable and maintainable ways. We develop miniapps for fast prototyping and optimizations. We implement new containers in structure-of-arrays data layout to facilitate vectorizations by the compilers. Further speedup and smaller memory-footprints are obtained by computing data on the fly with the vectorized routines and expanding single-precision use. All these are seamlessly incorporated in production QMCPACK. We demonstrate upto 4.5x speedups on recent Intel® processors and IBM Blue Gene/Q for representative workloads. Energy consumption is reduced significantly commensurate to the speedup factor. Memory-footprints are reduced by up-to 3.8x, opening the possibility to solve much larger problems of future. Amrita Mathuriya, Ye Luo 0001, Raymond C. Clay III, Anouar Benali, Luke Shulenburger, Jeongnim Kim |
SC | 5 |