{'fraction_non_alphanumeric': 0.022569444444444444, 'fraction_numerical': 0.0, 'mean_word_length': 5.1005291005291005, '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}}
A Critical Performance Study of Memory Mapping on Multi- Core Processors: An Experiment with k-means Algorithm with Large Data Mining Data Sets

Increased availability of Multi-Core processors is forcing us to re-design algorithms and applications so as to exploit the available computational power from multiple cores. It is not uncommon to employ memory mapping of files in applications involving huge I/O bandwidth to improve the response/service times. This paper mainly focuses on performance of memory mapped files on Multi-Core processors. Experiments are carried out with k-means algorithm, a popular Data mining (DM) clustering algorithm, to explore the potential of Multi-Core hardware under OpenMP API and POSIX threads. Observations are made both with static and dynamic threads of OpenMP. Experiments are also conducted with both simulated and real data sets. Experiments indicate that memory mapping of files gives considerable benefit on Multi-Core processors also. In addition, the benefit increased with increased physical memory size. Also, the benefit of memory mapping with the selected algorithm is increasing with number of cores.