Automatic clustering algorithm using factorisation tree for parallel power system simulation

J. Bialek, D. J. Grey

Результат исследований: Вклад в конференциюДокументрецензирование

Аннотация

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.

Язык оригиналаАнглийский
Страницыof 3/-
СостояниеОпубликовано - 1994
Опубликовано для внешнего пользованияДа
СобытиеProceedings of the 7th Mediterranean Electrotechnical Conference - MELECON. Part 1 (of 3) - Antalya, Turkey
Продолжительность: 12 апр. 199414 апр. 1994

Конференция

КонференцияProceedings of the 7th Mediterranean Electrotechnical Conference - MELECON. Part 1 (of 3)
ГородAntalya, Turkey
Период12/04/9414/04/94

Fingerprint

Подробные сведения о темах исследования «Automatic clustering algorithm using factorisation tree for parallel power system simulation». Вместе они формируют уникальный семантический отпечаток (fingerprint).

Цитировать