The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2007
DOI: 10.1007/978-3-540-72584-8_70
|View full text |Cite
|
Sign up to set email alerts
|

Multilevel Task Partition Algorithm for Parallel Simulation of Power System Dynamics

Abstract: Abstract. Nowadays task partition for parallel computing is becoming more and more important. Particular in power system dynamic simulation, it is critical to design an efficient partition algorithm to reduce the communication and balance the computation load [1]. This paper presents a novel multilevel partition scheme based on the graph partition algorithm. By introducing regional characteristic into the partition, improving the weights of nodes and edges, proposing an objective function to evaluate the parti… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
4
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 8 publications
1
4
0
Order By: Relevance
“…The work also makes some further efforts to optimize communication and computation. Overall, the methodology is very similar to that seen in [50], [51]. A speedup of roughly 10 is demonstrated.…”
Section: Transient Stability Simulationsupporting
confidence: 65%
See 1 more Smart Citation
“…The work also makes some further efforts to optimize communication and computation. Overall, the methodology is very similar to that seen in [50], [51]. A speedup of roughly 10 is demonstrated.…”
Section: Transient Stability Simulationsupporting
confidence: 65%
“…Implemented on a SMP cluster with 705 to 10,108 nodes, each with four processors, a super linear speedup is reported in almost all cases and the method is shown superior to previous methods.This work is further extended in [51] where a novel multilevel partitioning scheme is applied to dynamic power system simulations in order to efficiently map the problem to the HPC domain.…”
Section: G Simulationmentioning
confidence: 99%
“…But in ideal situations, it is better to use the number of processors that is divisible by the number of clusters to balance the computation load. It is a very vital task to appropriately partition the data so as to map the computational load onto the processors [32].…”
Section: Pseudo Code For Data Decompositionmentioning
confidence: 99%
“…3 shows the use of parallel programming to reduce the computational time required in a complete simulation. To achieve de maximum performance from the parallel scheme the computational load needs to be balanced [11], that is, all the processors must be kept busy all the time. A simple, but efficient way to achieve this aim is by having the same number of elements (in terms of computational effort) in each linked list.…”
Section: Parallel Programming Techniquesmentioning
confidence: 99%