Xing Luo, Honghua Xu, Ye Ji, Qicong Hu
tlooto Summary
This paper proposes a high-performance tensor factorization framework for large-scale power grid data that represents monitoring signals as structured high-order tensors, adopts a 3D block partitioning strategy for efficient distribution, and designs a lock-free scheduling scheme for stochastic updates to minimize synchronization overhead.
Abstract
The modern power grid has evolved into a large-scale, cyber-physical system with complex interactions among heterogeneous entities. Accurate modeling and analysis are essential, yet grid data often suffer from missing values due to sensor failures and communication issues. Tensor factorization is a powerful tool for capturing high-order dependencies and enabling data imputation, but existing methods face scalability and synchronization bottlenecks on large-scale heterogeneous tensors. To address these challenges, this paper proposes a high-performance tensor factorization framework for large-scale power grid data. The approach represents monitoring signals as structured high-order tensors, adopts a 3D block partitioning strategy for efficient distribution, and designs a lock-free scheduling scheme for stochastic updates to minimize synchronization overhead. Complexity analysis confirms the method's efficiency in both time and memory. Experiments on four real-world power grid datasets demonstrate superior scalability and efficiency performance compared with state-of-the-art methods.
Citation format
LUO, Xing, et al. A high-performance factorization method for high-order heterogeneous graph tensors from large-scale power grid. INTERNATIONAL JOURNAL OF WEB SERVICES RESEARCH, 2026, 23(1): 1–21.