{'fraction_non_alphanumeric': 0.013949433304272014, 'fraction_numerical': 0.0017436791630340018, 'mean_word_length': 5.713450292397661, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Voltage stability based contingency ranking using distributed computing environment

In recent years, voltage instability has been responsible for several incidents of major voltage collapses. For stable operation of power system, fast and accurate contingency analysis is required. Voltage stability contingency analysis requires computation of voltage stability margin accurately for each contingency case. This approach is time consuming, particularly in practical power systems where the number of contingencies is very large. This paper proposes a fast and accurate method for contingency ranking using distributed computing. In distributed computing, different parts of a program or the same program may be executed simultaneously on group of computers, which are communicating with each other over a network. The general-purpose computers that are networked can be utilized for distributed computing purpose. The effectiveness of the proposed approach has been tested on IEEE 30-bus system. The proposed distributed computing based approach for contingency ranking is found to be computationally efficient and provides near linear speedups.