{'fraction_non_alphanumeric': 0.02197802197802198, 'fraction_numerical': 0.0, 'mean_word_length': 5.333333333333333, '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}}
High Performance Statistical Cluster Computing with

The re-emergence of large out-of-core datasets as well as the common usage of simulation methods including bootstrap and MCMC algorithms have resulted in timeconsuming computations. One solution to this problem, when feasible, is to break up the computation into small, quickly computable pieces. We discuss both some of the practical applications, as well as tools which facilitate these applications.