{'fraction_non_alphanumeric': 0.029442691903259727, 'fraction_numerical': 0.015772870662460567, 'mean_word_length': 5.476190476190476, '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}}
Grid-enabled parallel divide-and-conquer: theory and practice

This paper presents a general methodology for the communication-efficient parallelization of graph algorithms using the divide-and-conquer approach. The algorithm is communication-free in the conquer stage and uses only a small amount of messages while partitioning the input. Specifically, a practical parallel algorithm with full scalability, based on the BSP model, for finding Hamiltonian paths in tournaments is presented.Experiments have been carried out on two architecturally different systems, which stand for the possible site variety of a computational grid. These include a distributed-memory system: a Solaris cluster of 32 Sun Ultra5 computers on Myrinet network and a distributed shared-memory system: an SGI Origin 2000 with 32 R10000 processors, using MPICH-GM and MPT, respectively. Both implementations are compatible with the grid-enabled MPI implementation, MPICH-G2.