{'fraction_non_alphanumeric': 0.01876675603217158, 'fraction_numerical': 0.0, 'mean_word_length': 5.4, '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}}
Process/Processor Mapping Based on Similarity Analysis in Heterogeneous Grid Computing Environment

This paper presents a direct approach to partitioning for resolving process/processor mapping problems in a heterogeneous grid environment. It employs a scheme of analyzing similarities in graphs to cluster processes and select processors. Based on a phase for pre-analyzing the underlying network topology, it takes the information on the underlying network topology into account to select processors during the process-partitioning procedure. During the refinement phase to add certain capabilities for jumping out of the local optima and satisfying the requirements for steady performance, we used a two-stage Kernighan-Lin (KL)-like approach in our current study without introducing any randomness. Experiments were done to assess the performance of this algorithm, and compare it to the popular KL-like algorithm with a sequential-mapping approach and a greedy-based approach to search for the initial solution. The new proposal is capable of finding better solutions than these other two approaches in most cases.