Faster-Than-Real-Time Dynamic Simulation of AC/DC Grids on Reconfigurable Hardware
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Dynamic simulation of integrated AC and DC grids is paramount to address real-time operation challenges in energy control centers, such as available transfer capacities, relieving grid congestion, and taking effective control actions for improving the integrated grid system stability and reliability. This paper proposes a faster-than-real-time (FTRT) dynamic simulation of integrated AC/DC grids on the reconfigurable parallel hardware architecture of the field programmable gate array (FPGA). A fine-grained relaxation algorithm (FGRA) is proposed for a more efficient solution of the nonlinear differential algebraic equations of the integrated system model, including the detailed nonlinear models of the synchronous generators in the AC system which can be solved in parallel without matrix on the FPGA. The system solution is massively parallelized and pipelined in hardware to realize the lowest latencies and minimum utilization of hardware resource. Two case studies are used to illustrate the efficacy of the proposed algorithm and demonstrated a closed-loop prediction scenario for improving grid stability. Computational acceleration of up to 134 times faster than real-time are reported for the two case studies, and the accuracy of the dynamic interaction is validated using the off-line transient stability simulation tool TSAT of the DSATools package.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it