{'fraction_non_alphanumeric': 0.017278617710583154, 'fraction_numerical': 0.0, 'mean_word_length': 5.098684210526316, '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 Task Partition Algorithm Based on Grid and Graph Partition for Distributed Crowd Simulation

The task partition algorithm is the key issues in distributed crowd simulation. To overcome low execution performance of existing task partition methods, we proposed a partition algorithm based on grid and graph partition. Firstly, the virtual environment is partitioned by uniform grid, gpu threads are introduced to accelerating the calculation. Later, all pairs of neighbor cells of the grid are connected with an edge. Then a connected graph is constructed, the cells are set as vertexes and the edges connect the cells. Finally, the connected graph is split by k-way partition method for task assignment. The experiments prove that the coarser-grained method can provide higher performance than existing algorithms for different population distribution while keeping low cost. Also the max imbalance rate can be kept very low.