Demo Data from VLDB 2026 / reviewers in the wild / expert
Mike Mazzola
dblp:214/1951
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2018
0000-0003-1355-8145ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 · 61% Performance modeling and evaluation · 30% Electronic design automation · 9% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
High-performance computing
domain decomposition |
0.3 | 1 | 2018 | A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence · IEEE Trans. Parallel Distributed Syst. 2018 |
Performance modeling and evaluation › simulation › parallel and distributed simulation
parallel simulation |
0.3 | 1 | 2018 | A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence · IEEE Trans. Parallel Distributed Syst. 2018 |
High-performance computing
power system simulation |
0.3 | 1 | 2018 | A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence · IEEE Trans. Parallel Distributed Syst. 2018 |
Electronic design automation › circuit simulation › numerical methods for circuit simulation
convergence acceleration |
0.1 | 1 | 2018 | A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved Convergence · IEEE Trans. Parallel Distributed Syst. 2018 |
Methods — techniques the papers use, named apart from their topics
relaxation-based decomposition · 0.3preconditioner · 0.3parallel-general-norton · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | A Relaxation-Based Network Decomposition Algorithm for Parallel Transient Stability Simulation with Improved ConvergenceabstractTransient stability simulation of a large-scale and interconnected electric power system involves solving a large set of differential algebraic equations (DAEs) at every simulation time-step. With the ever-growing size and complexity of power grids, dynamic simulation becomes more time-consuming and computationally difficult using conventional sequential simulation techniques. To cope with this challenge, this paper aims to develop a fully distributed approach intended for implementation on High Performance Computer (HPC) clusters. A novel, relaxation-based domain decomposition algorithm known as Parallel-General-Norton with Multiple-port Equivalent (PGNME) is proposed as the core technique of a two-stage decomposition approach to divide the overall dynamic simulation problem into a set of subproblems that can be solved concurrently to exploit parallelism and scalability. While the convergence property has traditionally been a concern for relaxation-based decomposition, an estimation mechanism based on multiple-port network equivalent is adopted as the preconditioner to enhance the convergence of the proposed algorithm. The proposed algorithm is illustrated using rigorous mathematics and validated both in terms of speed-up and capability. Moreover, a complexity analysis is performed to support the observation that PGNME scales well when the size of the subproblems are sufficiently large. Brian Sullivan, Mike Mazzola, Babak Saravi, Uttam Adhikari, Tomasz Haupt |
IEEE Trans. Parallel Distributed Syst. | 3 |