Brian Austin

ORCID: 0009-0005-5881-1927
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Advanced Chemical Physics Studies
  • Parallel Computing and Optimization Techniques
  • Advanced Data Storage Technologies
  • Distributed and Parallel Computing Systems
  • Cloud Computing and Resource Management
  • Catalysis and Oxidation Reactions
  • Spectroscopy and Quantum Chemical Studies
  • Particle accelerators and beam dynamics
  • Particle Accelerators and Free-Electron Lasers
  • Quantum, superfluid, helium dynamics
  • Machine Learning in Materials Science
  • Interconnection Networks and Systems
  • Embedded Systems Design Techniques
  • Advanced X-ray Imaging Techniques
  • Quantum Computing Algorithms and Architecture
  • Physics of Superconductivity and Magnetism
  • Semiconductor materials and devices
  • Advanced Thermodynamics and Statistical Mechanics
  • Scientific Computing and Data Management
  • Business Process Modeling and Analysis
  • Galaxies: Formation, Evolution, Phenomena
  • Neutrino Physics Research
  • Molecular spectroscopy and chirality
  • Phase Equilibria and Thermodynamics
  • Scheduling and Optimization Algorithms

Lawrence Berkeley National Laboratory
2014-2024

Advanced Technologies Group (United States)
2024

National Energy Research Scientific Computing Center
2012-2024

University of California, Berkeley
2005-2014

University of California System
2011

Jilin University
2010

Yihan Shao Zhengting Gan Evgeny Epifanovsky Andrew T. B. Gilbert Michael Wormit and 95 more Jörg Kußmann Adrian W. Lange Andrew Behn Jia Deng Xintian Feng Debashree Ghosh Matthew Goldey Paul R. Horn Leif D. Jacobson Ilya Kaliman Rustam Z. Khaliullin Tomasz Kuś Arie Landau Jie Liu Emil Proynov Young Min Rhee Ryan M. Richard Mary A. Rohrdanz Ryan P. Steele Eric J. Sundstrom H. Lee Woodcock Paul M. Zimmerman Dmitry Zuev Ben Albrecht Ethan Alguire Brian Austin Gregory J. O. Beran Yves Bernard Eric Berquist Kai Brandhorst Ksenia B. Bravaya Shawn T. Brown David Casanova C C Chang Yunqing Chen Siu Hung Chien Kristina D. Closser Deborah L. Crittenden Michael Diedenhofen Robert A. DiStasio Hainam Do Anthony D. Dutoi Richard G. Edgar Shervin Fatehi László Füsti-Molnár An Ghysels Anna Golubeva-Zadorozhnaya Joseph Gomes Magnus W. D. Hanson‐Heine Philipp H. P. Harbach Andreas Hauser Edward G. Hohenstein Zachary C. Holden Thomas‐C. Jagau Hyunjun Ji Benjamin Kaduk Kirill Khistyaev Jaehoon Kim Jihan Kim Rollin A. King Phil Klunzinger Dmytro Kosenkov Tim Kowalczyk Caroline M. Krauter Ka Un Lao Adèle D. Laurent Keith V. Lawler Sergey V. Levchenko Ching Yeh Lin Fenglai Liu Ester Livshits Rohini C. Lochan Arne Luenser Prashant Uday Manohar Samuel F. Manzer Shan-Ping Mao Narbe Mardirossian Aleksandr V. Marenich Simon A. Maurer Nicholas J. Mayhall Eric Neuscamman C. Melania Oana Roberto Olivares‐Amaya D.P. O'Neill John Parkhill Trilisa M. Perrine Roberto Peverati Alexander Prociuk Dirk R. Rehn Edina Rosta Nicholas J. Russ Shaama Mallikarjun Sharada Sandeep Sharma David W. Small Alexander J. Sodt

A summary of the technical advances that are incorporated in fourth major release Q-Chem quantum chemistry program is provided, covering approximately last seven years. These include developments density functional theory methods and algorithms, nuclear magnetic resonance (NMR) property evaluation, coupled cluster perturbation theories, for electronically excited open-shell species, tools treating extended environments, algorithms walking on potential surfaces, analysis tools, energy...

10.1080/00268976.2014.952696 article EN Molecular Physics 2014-09-03

Modern scientific datasets present numerous data management and analysis challenges. State-of-the-art index query technologies are critical for facilitating interactive exploration of large datasets, but challenges remain in terms designing a system processing general datasets. The needs to be able run on distributed multi-core platforms, efficiently utilize underlying I/O infrastructure, scale massive

10.1145/2063384.2063424 article EN 2011-11-08

Network congestion is one of the biggest problems facing HPC systems today, affecting system throughput, performance, user experience, and reproducibility. Congestion manifests as run-to-run variability due to contention for shared resources (e.g., filesystems) or routes between compute endpoints. Despite its significance, current network benchmarks fail proxy real-world utilization seen on congested systems. We propose a new open-source benchmark suite called Global Performance Tests...

10.1145/3295500.3356215 article EN 2019-11-07

The perfect pairing (PP) approximation from generalized valence bond theory is formulated in an unrestricted fashion for both closed- and open-shell systems using a coupled cluster ansatz. In the model chemistry proposed here, active electron pairs are correlated, but unpaired or radical electrons remain uncorrelated, leading to linear number of decoupled amplitudes which can be solved analytically. alpha beta spatial orbitals variationally optimized independently. This minimal treatment...

10.1021/jp053780c article EN The Journal of Physical Chemistry A 2005-09-17

Summary There are many potential issues associated with deploying the Intel Xeon Phi TM (code named Knights Landing [KNL]) manycore processor in a large‐scale supercomputer. One particular is ability to fully utilize high‐speed communications network, given that serial performance of core fraction Xeon®core. In this paper, we take look at trade‐offs allocating enough cores Aries network versus dedicated computation, eg, trade‐off between MPI and OpenMP. addition, evaluate new features Cray...

10.1002/cpe.4297 article EN Concurrency and Computation Practice and Experience 2017-09-12

Understanding patterns of application energy use is key to reaching future HPC efficiency goals. We have measured the sensitivity CPU frequency for several microbenchmarks and applications on a Cray XC30. suggest first order models performance power vs. show that these are sufficient accurately fit data. Examination resulting model shows an application's energy/frequency profiles minima only if a) change crosses architectural balance point performance-critical particular or b) significant...

10.1109/e2sc.2014.7 article EN 2014-11-01

High performance computing (HPC) is undergoing significant changes. The emerging HPC applications comprise both compute- and data-intensive applications. To meet the intense I/O demand from applications, burst buffers are deployed in production systems. Existing schedulers mainly CPU-centric. extreme heterogeneity of hardware devices, combined with workload changes, forces to consider multiple resources (e.g., buffers) beyond CPUs, decision making. In this study, we present a multi-resource...

10.1145/3307681.3325401 preprint EN 2019-06-17

Abstract A new algorithm is presented for the sparse representation and evaluation of Slater determinants in quantum Monte Carlo (QMC) method. The approach, combined with use localized orbitals a Slater‐type orbital basis set, significantly extends size molecule that can be treated QMC Application to systems containing up 390 electrons confirms cost evaluating determinant scales linearly system size. © 2005 Wiley Periodicals, Inc. J Comput Chem 26: 708–715,

10.1002/jcc.20205 article EN Journal of Computational Chemistry 2005-03-10

Abstract The Zori 1.0 package for electronic structure computations is described. performs variational and diffusion Monte Carlo as well correlated wave function optimization. This article presents an overview of the implemented methods code capabilities. © 2005 Wiley Periodicals, Inc. J Comput Chem 26: 856–862,

10.1002/jcc.20215 article EN Journal of Computational Chemistry 2005-04-07

The homolytic O−H bond dissociation energy (BDE) of phenol was determined from diffusion Monte Carlo (DMC) calculations using single determinant trial wave functions. DMC gives an BDE 87.0 ± 0.3 kcal/mol when restricted Hartree−Fock orbitals are used and a 87.5 with B3LYP Kohn−Sham orbitals. These results in good agreement the extrapolated B3P86 Costa Cabral Canuto (88.3 kcal/mol), recommended experimental value Borges dos Santos Martinho Simões (88.7 0.5 G3 (88.2 CBS-APNO CBS-QB3 (87.1...

10.1021/jp103010g article EN The Journal of Physical Chemistry A 2010-07-22

We present an efficient implementation of the perfect pairing and imperfect coupled-cluster methods, as well their nuclear gradients, using resolution identity approximation to calculate two-electron integrals. The equations may be solved rapidly, making integral evaluation bottleneck step. method's efficiency is demonstrated for a series linear alkanes, which we show significant speed-ups (of approximately factor 10) with negligible error. also apply method model recently synthesized stable...

10.1021/ct050239b article EN Journal of Chemical Theory and Computation 2006-01-11

The nature of dark energy and the complete theory gravity are two central questions currently facing cosmology. A vital tool for addressing them is 3-point correlation function (3PCF), which probes deviations from a spatially random distribution galaxies. However, 3PCF's formidable computational expense has prevented its application to astronomical surveys comprising millions billions We present Galactos, high-performance implementation novel, O(N2) algorithm that uses load-balanced k-d tree...

10.1145/3126908.3126927 preprint EN 2017-11-08

Power is increasingly becoming a limiting factor in supercomputing. The performance and scale of future highperformance computing systems will be determined by how efficiently they manage their power budgets. Therefore any amount unused forsaken performance. Regardless the processors chosen for system, it necessary to understand variation its implications on optimization. In this paper, we identify quantify factors that affect consumption NERSC Cori supercomputer at different levels system...

10.1109/pmbs54543.2021.00011 article EN 2021-11-01

When acquiring a supercomputer it is desirable to specify its performance using single number. For many procurements, this usually stated as increase over current generation platform, for example machine A provides 10 times greater than B. The determination of such number not necessarily simple process; there no universal agreement on how calculation performed and each facility uses their own method. In the future, landscape will be further complicated because systems contain heterogeneous...

10.1109/pmbs.2018.8641549 article EN 2018-11-01

HPC facilities typically use batch scheduling to space-share jobs. In this paper we revisit time-sharing using a trace of over 2.4 million jobs obtained during 20 months operation modern petascale supercomputer. Our simulations show that produces skewed distributions with much larger slowdowns for shorter-running, jobs, whereas more uniform slowdowns. Consequently, applications strong scale, the turnaround time does not scale scheduling, but it time-sharing, resulting in turnarounds are...

10.1109/hpcc-smartcity-dss.2016.0051 article EN 2016-12-01

Extension of the conventional 2 pi structure for particle acceleration to 200 Mev or higher requires minimization power losses by optimizing cavity and drift-tube parameters. Using a previously developed method, an optimization dimensions was made at Mc energies 50, 100, 150, give minimum cylindrical tubes. Drift tubes other shapes may reduce observed high-energy due currents in surface. Ellipsoidal appear more efficient than (D.C.W.)

10.5170/cern-1963-019.372 article EN 1963-04-01

The hierarchical semi-separable (HSS) matrix factorization has useful characteristics for representing low-rank operators on extreme scale computing systems. To prepare the higher error rates anticipated with future architectures, this paper introduces new fault-tolerant algorithms HSS multiplication that maintain efficient performance in presence of high rates. measured runtime overhead checking and data preservation using Containment Domains library is exceptionally small encourages use...

10.1145/2751504.2751507 article EN 2015-06-08
Coming Soon ...