G-2025-32
Task mapping strategies for electric power system simulations on heterogeneous clusters
, , and BibTeX reference
In this work, we propose improved task mapping strategies for real-time electric power system simulations on heterogeneous computing clusters, considering both heterogeneous communication links and processing capacities, with a focus on bottleneck objectives. We approach the problem through two complementary models: the bottleneck quadratic semi-assignment problem (BQSAP), which optimizes task configuration for a fixed number of computing nodes while minimizing communication and computation costs; and the variable-size bin packing problem with quadratic communication constraints (Q-VSBPP), which minimizes the required number of computing nodes, particularly valuable for resource provisioning scenarios. We extend the PuLP library to solve both problems with the explicit inclusion of communication costs and the processing constraints, and formalizing the nomenclature and definitions for bottleneck objectives in graph partitioning. This formalization fills a gap in the existing literature and provides a framework for the rigorous analysis and application of task mapping techniques to real-time electric power system simulation. Finally, we provide a quantitative study and benchmark the extended PuLP library with the SCOTCH partitioning library in the context of real-time electromagnetic transient (EMT) simulation task mapping.
Published April 2025 , 12 pages
Research Axis
Research applications
Document
G2532.pdf (2 MB)