DOI QR코드

DOI QR Code

Analysis of Distributed Computational Loads in Large-scale AC/DC Power System using Real-Time EMT Simulation

대규모 AC/DC 전력 시스템 실시간 EMP 시뮬레이션의 부하 분산 연구

  • In Kwon, Park (KEPCO Research Institute, Korea Electric Power Corporation) ;
  • Yi, Zhong Hu (KEPCO Research Institute, Korea Electric Power Corporation) ;
  • Yi, Zhang (KEPCO Research Institute, Korea Electric Power Corporation) ;
  • Hyun Keun, Ku (KEPCO Research Institute, Korea Electric Power Corporation) ;
  • Yong Han, Kwon (KEPCO Research Institute, Korea Electric Power Corporation)
  • Received : 2022.06.30
  • Accepted : 2022.09.16
  • Published : 2022.12.30

Abstract

Often a network becomes complex, and multiple entities would get in charge of managing part of the whole network. An example is a utility grid. While the entire grid would go under a single utility company's responsibility, the network is often split into multiple subsections. Subsequently, each subsection would be given as the responsibility area to the corresponding sub-organization in the utility company. The issue of how to make subsystems of adequate size and minimum number of interconnections between subsystems becomes more critical, especially in real-time simulations. Because the computation capability limit of a single computation unit, regardless of whether it is a high-speed conventional CPU core or an FPGA computational engine, it comes with a maximum limit that can be completed within a given amount of execution time. The issue becomes worsened in real time simulation, in which the computation needs to be in precise synchronization with the real-world clock. When the subject of the computation allows for a longer execution time, i.e., a larger time step size, a larger portion of the network can be put on a computation unit. This translates into a larger margin of the difference between the worst and the best. In other words, even though the worst (or the largest) computational burden is orders of magnitude larger than the best (or the smallest) computational burden, all the necessary computation can still be completed within the given amount of time. However, the requirement of real-time makes the margin much smaller. In other words, the difference between the worst and the best should be as small as possible in order to ensure the even distribution of the computational load. Besides, data exchange/communication is essential in parallel computation, affecting the overall performance. However, the exchange of data takes time. Therefore, the corresponding consideration needs to be with the computational load distribution among multiple calculation units. If it turns out in a satisfactory way, such distribution will raise the possibility of completing the necessary computation in a given amount of time, which might come down in the level of microsecond order. This paper presents an effective way to split a given electrical network, according to multiple criteria, for the purpose of distributing the entire computational load into a set of even (or close to even) sized computational loads. Based on the proposed system splitting method, heavy computation burdens of large-scale electrical networks can be distributed to multiple calculation units, such as an RTDS real time simulator, achieving either more efficient usage of the calculation units, a reduction of the necessary size of the simulation time step, or both.

Keywords

References

  1. Karypis Lab. "METIS - Serial Graph Partitioning and Fill-reducing Matrix Ordering." (accessed.)
  2. "PyMetis: A Python Wrapper for METIS." https://github.com/inducer/pymetis (accessed.)
  3. G. Karypis and V. Kumar, "Multilevelk-way Partitioning Scheme for Irregular Graphs," Journal of Parallel and Distributed Computing, vol. 48, no. 1, pp. 96-129, 1998/01/10/ 1998, doi: https://doi.org/10.1006/jpdc.1997.1404.
  4. V. Dinavahi and N. Lin, Parallel Dynamic and Transient Simulation of Large-Scale Power Systems: A High Performance Computing Solution. Cham: Springer International Publishing AG, 2021, https://doi.org/10.1007/978-3-030-86782-9