EDBT 2026 Demo / reviewers in the wild / expert
Byounghak Lee
dblp:24/1400
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2009
0000-0002-1690-2493ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Theory of computation · 1
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 |
High-performance computing · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational science and engineering · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing › scientific computing systems
electronic structure calculation |
0.1 | 1 | 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculations · SC 2008 |
High-performance computing
performance optimization at scale |
0.1 | 1 | 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculations · SC 2008 |
High-performance computing
scientific computing systems |
0.1 | 1 | 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculations · SC 2008 |
Computational science and engineering › computational chemistry › electronic structure calculation
density functional theory |
0.0 | 1 | 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculations · SC 2008 |
Computational science and engineering › materials science
materials science simulation |
0.0 | 1 | 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculations · SC 2008 |
Methods — techniques the papers use, named apart from their topics
patching scheme · 0.2fragment method · 0.2divide-and-conquer · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | KSSOLV - a MATLAB toolbox for solving the Kohn-Sham equationsabstractWe describe the design and implementation of KSSOLV, a MATLAB toolbox for solving a class of nonlinear eigenvalue problems known as the Kohn-Sham equations . These types of problems arise in electronic structure calculations, which are nowadays essential for studying the microscopic quantum mechanical properties of molecules, solids, and other nanoscale materials. KSSOLV is well suited for developing new algorithms for solving the Kohn-Sham equations and is designed to enable researchers in computational and applied mathematics to investigate the convergence properties of the existing algorithms. The toolbox makes use of the object-oriented programming features available in MATLAB so that the process of setting up a physical system is straightforward and the amount of coding effort required to prototype, test, and compare new algorithms is significantly reduced. All of these features should also make this package attractive to other computational scientists and students who wish to study small- to medium-size systems. Chao Yang 0001, Juan C. Meza, Byounghak Lee, Lin-Wang Wang |
ACM Trans. Math. Softw. | 3 |
| 2008 | Linearly scaling 3D fragment method for large-scale electronic structure calculationsabstractWe present a new linearly scaling three-dimensional fragment (LS3DF) method for large scale ab initio electronic structure calculations. LS3DF is based on a divide-and-conquer approach, which incorporates a novel patching scheme that effectively cancels out the artificial boundary effects due to the subdivision of the system. As a consequence, the LS3DF program yields essentially the same results as direct density functional theory (DFT) calculations. The fragments of the LS3DF algorithm can be calculated separately with different groups of processors. This leads to almost perfect parallelization on over one hundred thousand processors. After code optimization, we were able to achieve 60.3 Tflop/s, which is 23.4% of the theoretical peak speed on 30,720 Cray XT4 processor cores. In a separate run on a BlueGene/P system, we achieved 107.5 Tflop/s on 131,072 cores, or 24.2% of peak. Our 13,824-atom ZnTeO alloy calculation runs 400 times faster than a direct DFT calculation, even presuming that the direct DFT calculation can scale well up to 17,280 processor cores. These results demonstrate the applicability of the LS3DF method to material simulations, the advantage of using linearly scaling algorithms over conventional O(N3) methods, and the potential for petascale computation using the LS3DF method. Lin-Wang Wang, Byounghak Lee, Hongzhang Shan, Zhengji Zhao, Juan C. Meza, Erich Strohmaier, David H. Bailey |
SC | 2 |