Automatic clustering algorithm using factorisation tree for parallel power system simulation

J. Bialek, D. J. Grey

Research output: Contribution to conferencePaperpeer-review

Abstract

Parallel simulation of power systems requires the system to be partitioned into subnetworks which are processed on individual processors. Maximum computational efficiency is achieved when the network is split such that each processors has an equal computational load. This paper proposes an automatic method of network partitioning which gives well balanced network splits, based upon an analysis of the factorisation tree for the system. The method also predicts the expected parallel speed-up for the split and allows the visualisation of large networks. A modified Minimum Degree Minimum Length node ordering algorithm is also presented which gives well balanced factorisation trees.

Original languageEnglish
Pagesof 3/-
Publication statusPublished - 1994
Externally publishedYes
EventProceedings of the 7th Mediterranean Electrotechnical Conference - MELECON. Part 1 (of 3) - Antalya, Turkey
Duration: 12 Apr 199414 Apr 1994

Conference

ConferenceProceedings of the 7th Mediterranean Electrotechnical Conference - MELECON. Part 1 (of 3)
CityAntalya, Turkey
Period12/04/9414/04/94

Fingerprint

Dive into the research topics of 'Automatic clustering algorithm using factorisation tree for parallel power system simulation'. Together they form a unique fingerprint.

Cite this