{'fraction_non_alphanumeric': 0.009569377990430622, 'fraction_numerical': 0.0, 'mean_word_length': 5.474226804123711, '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}}
Multiprocessor FFT Methods

Proceeding first by experiment and then by analysis, the problem of implementing FFT algorithms on a shared memory multiprocessor is investigated. Several algorithms for performing a single FFT and multiple FFTs are implemented and compared on the Denelcor HEP computer. These algorithms are then analyzed using performance models which reproduce the experimental timing curves. For both the single and multiple FFT a clear choice of superior algorithms can be made. These algorithms are expected to be useful and to preserve their performance characteristics on other shared memory multiprocessors.