Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hong Zhang 0006

dblp:24/6914-6 · DBLP profile ↗
← Back
8ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-7720-0049ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 1 first-author · 1 since 2021Theory of computation · 2 · 1 first-author

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 · 57% Parallel and multicore computing · 38% Interconnection networks and networks-on-chip · 6%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallel algorithms › parallel algorithm design
divide-and-conquer parallelization
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992
Parallel and multicore computing
parallel algorithms
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992
High-performance computing › numerical linear algebra › linear solver
parallel linear solvers
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992
High-performance computing
scientific computing systems
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992
High-performance computing › sparse linear solver
tridiagonal solver
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992
Interconnection networks and networks-on-chip
interprocessor communication
0.011992
Efficient Tridiagonal Solvers on Multicomputers · IEEE Trans. Computers 1992

Methods — techniques the papers use, named apart from their topics

parallel partition hybrid · 0.0parallel partition LU · 0.0parallel diagonal dominant · 0.0
YearPublicationVenuePosition
2021 Toward performance-portable PETSc for GPU-based exascale systems
Richard Tran Mills, Mark F. Adams, Satish Balay, Jed Brown, Alp Dener, Matthew G. Knepley, Scott Kruger, Hannah Morgan, Todd S. Munson, Karl Rupp, Barry Smith 0002, Stefano Zampini, Hong Zhang 0006, Junchao Zhang 0002
Parallel Comput.13
2020 PETSc DMNetwork: A Library for Scalable Network PDE-Based Multiphysics Simulations
abstract
We present DMNetwork, a high-level package included in the PETSc library for the simulation of multiphysics phenomena over large-scale networked systems. The library aims at applications that have networked structures such as those in electrical, gas, and water distribution systems. DMNetwork provides data and topology management, parallelization for multiphysics systems over a network, and hierarchical and composable solvers to exploit the problem structure. DMNetwork eases the simulation development cycle by providing the necessary infrastructure through simple abstractions to define and query the network components. This article presents the design of DMNetwork, illustrates its user interface, and demonstrates its ability to solve multiphysics systems, such as an electric circuit, a network of power grid and water subnetworks, and transient hydraulic systems over large networks with more than 2 billion variables on extreme-scale computers using up to 30,000 processors.
Shrirang Abhyankar, Getnet D. Betrie, Daniel A. Maldonado, Lois C. McInnes, Barry Smith 0002, Hong Zhang 0006
ACM Trans. Math. Softw.6
2018 Vectorized Parallel Sparse Matrix-Vector Multiplication in PETSc Using AVX-512
abstract
Emerging many-core CPU architectures with high degrees of single-instruction, multiple data (SIMD) parallelism promise to enable increasingly ambitious simulations based on partial differential equations (PDEs) via extreme-scale computing. However, such architectures present several challenges to their efficient use. Here, we explore the efficient implementation of sparse matrix-vector (SpMV) multiplications---a critical kernel for the workhorse iterative linear solvers used in most PDE-based simulations---on recent CPU architectures from Intel as well as the second-generation Knights Landing Intel Xeon Phi, which features many CPU cores, wide SIMD lanes, and on-package high-bandwidth memory. Traditional SpMV algorithms use compressed sparse row storage format, which is a hindrance to exploiting wide SIMD lanes. We study alternative matrix formats and present an efficient optimized SpMV kernel, based on a sliced ELLPACK representation, which we have implemented in the PETSc library. In addition, we demonstrate the benefit of using this representation to accelerate preconditioned iterative solvers in realistic PDE-based simulations in parallel.
Hong Zhang 0006, Richard Tran Mills, Karl Rupp, Barry Smith 0002
ICPP1
2016 Lightweight and Accurate Silent Data Corruption Detection in Ordinary Differential Equation Solvers
Pierre-Louis Guhur, Hong Zhang 0006, Tom Peterka, Emil M. Constantinescu, Franck Cappello
Euro-Par2
2014 Hierarchical Krylov and nested Krylov methods for extreme-scale computing
Lois C. McInnes, Barry Smith 0002, Hong Zhang 0006, Richard Tran Mills
Parallel Comput.3
2010 FACETS
abstract
Coupling separately developed codes offers an attractive method for increasing the accuracy and fidelity of the computational models. Examples include the earth sciences and fusion integrated modeling. This paper describes the Framework Application for Core-Edge Transport Simulations (FACETS).
John R. Cary, Ammar Hakim, Mahmood Miah, Scott Kruger, Alexander Pletzer, Svetlana G. Shasharina, Srinath Vadlamani, Ronald H. Cohen, Thomas Epperly, Thomas D. Rognlien, Alexei Pankin, Richard Groebner, Satish Balay, Lois C. McInnes, Hong Zhang 0006
PDP15
2007 SIPs: Shift-and-invert parallel spectral transformations
abstract
SIPs is a new efficient and robust software package implementing multiple shift-and-invert spectral transformations on parallel computers. Built on top of SLEPc and PETSc, it can compute very large numbers of eigenpairs for sparse symmetric generalized eigenvalue problems. The development of SIPs is motivated by applications in nanoscale materials modeling, in which the growing size of the matrices and the pathological eigenvalue distribution challenge the efficiency and robustness of the solver. In this article, we present a parallel eigenvalue algorithm based on distributed spectrum slicing. We describe the object-oriented design and implementation techniques in SIPs, and demonstrate its numerical performance on an advanced distributed computer.
Hong Zhang 0006, Barry Smith 0002, Michael G. Sternberg, Peter Zapol
ACM Trans. Math. Softw.1
1992 Efficient Tridiagonal Solvers on Multicomputers
abstract
Three parallel algorithms, namely, the parallel partition LU (PPT) algorithm, the parallel partition hybrid (PPH) algorithm, and the parallel diagonal dominant (PDD) algorithm, are proposed for solving tridiagonal linear systems on multicomputers. These algorithms are based on the divide-and-conquer parallel computation model. The PPT and PPH algorithms support both pivoting and nonpivoting. The PPT algorithm is good when the number of processors is small; otherwise, the PPH algorithm is better. When the system is diagonal dominant, the PDD algorithm is highly parallel and provides an approximate solution which equals the exact solution within machine accuracy. Computation and communication complexities of the three algorithms are presented. All three methods have been implemented on a 64-node nCUBE-1 multicomputer. The analytic results closely match the results measured from the nCUBE-1 machine.>
Xian-He Sun, Hong Zhang 0006, Lionel M. Ni
IEEE Trans. Computers2