{'fraction_non_alphanumeric': 0.009922822491730982, 'fraction_numerical': 0.0, 'mean_word_length': 5.013245033112582, '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}}
Performance Analysis of Parallel Apriori on Heterogeneous Nodes

The paper analyzes the performance of parallel Apriori Algorithm on heterogeneous nodes with different datasets and over n processors on a commodity cluster of machines. In the Apriori Algorithm all processes need to synchronize after every pass. If any process is assigned more load than other processes in the system, the slowest process will dictate the speed of the program. It is therefore important to ensure that load is equally balanced among all processes. Memory, speed of the processor and cache play a significant role in the processing capacity of the system. The experiments show that nodes with different configurations affect the performance of the parallel apriori algorithm. In order to maximize the efficiency it is required to balance the data set based on the processing speed of the various nodes present in the cluster.