{'fraction_non_alphanumeric': 0.01098901098901099, 'fraction_numerical': 0.0, 'mean_word_length': 4.993421052631579, '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}}
PARALLEL GENETIC ALGORITHMS IMPLEMENTED ON TRANSPUTERS

This paper deals with a course-grain parallel genetic algorithm for solving the placement and TSP problem as well. Both of them are typical tasks from the field of the layout design of VLSI circuits. It can be proved that both are NP problems. A TRANSGEN program was created in OCCAM language, which enables wide class experiments via extensive menu for setting main parameters of genetic optimization. The main attention was paid to the adaptation of main genetics operators including the migration operator usable for placement optimization. To test TRANSGEN algorithm some experiments were done. A few circuits were used to be illustrated the behaviour of the algorithm. From this experiments we have concluded that the achieved linear speedup of the parallel version of the genetic program is effected by a better covergence of the itaration process.