An Online Prony Analysis Method Based on Dual Parallel Computing
A technology of parallel computing and analysis methods, applied in computing, instruments, electrical digital data processing, etc., can solve the problems that the computing speed cannot meet the online analysis, and achieve the effect of improving resource utilization and computing efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0104] An online Prony analysis method based on dual parallel computing. The method includes the following steps:
[0105] (a) In an AC interconnected power grid composed of I branches and J nodes, each branch and all nodes are equipped with a synchronous measurement unit PMU; the structure of the computing platform is as follows figure 1 As shown, a cluster composed of a client, a management node, and C computing nodes, where C i Represents the i-th computing node, P i Is C i The number of cores, C ij Means C i The j-th core in, i=1, 2,..., C, j=1, 2, 3,..., P i ;
[0106] (b) When low-frequency oscillation occurs in the power grid, the E electrical quantities of the M branches collected by the PMU include: active power ΔP, frequency Δω, take the same time period sampling data as a group and send it to the computing platform for Prony analysis, then The number of tasks to be analyzed is N=EM, M=1, 2,..., I; each type of electrical quantity contains Len sampling data, 500≤Len≤3000;...
Embodiment 2
[0138] (1) The wide-area measurement system uses Prony analysis method for parameter identification on the active power and frequency data of 50 tie lines, which is equivalent to 100 Prony calculation tasks.
[0139] (2) There are 1 management node and 2 8-core computing nodes C 1 , C 2 In the formed cluster, when the management node receives the client's task N=100, it performs Prony parallel calculation.
[0140] (3) The management node arbitrarily selects a task from N tasks, and sends this task to C at the same time 1 And C 2 Calculate on the computer and record the execution time of each node for the task. C in this example 1 The execution time is T 1 =0.037s, C 2 Execution time is T 2 =0.035s. According to T 1 / (T 1 +T 2 ) And T 2 / (T 1 +T 2 ) Will N 1 = 51 tasks sent to C 1 On calculation, N 2 = 49 tasks sent to C 2 上算。 On calculation. By C 1 And C 2 Respectively perform single-machine multi-threaded parallel computing.
[0141] (4)C 1 The number of tasks received is N 1 , C...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


