{'fraction_non_alphanumeric': 0.009891196834817012, 'fraction_numerical': 0.008902077151335312, 'mean_word_length': 4.883720930232558, '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 Simulation of Tasks Scheduling and Scheduling Criteria in High-performance Computing Systems

This work is focused on the issue of job scheduling in a high performance computing systems. The goal is based on the analysis of scheduling models of tasks in grid and cloud, design and implementation of the simulator on the base of GPGPU. The simulator is verified by our own proposed model of job scheduling. The simulator consists of a centralized scheduler that is using GPGPU to process large amounts of data by parallel way. In order to ensure the optimization of the scheduling process we have implemented a simulated annealing algorithm. GPGPU model was compared to the CPU when the number of nodes from 32 to 2048. Improving the implementation based on GPGPU had a significant impact on the system with 512 nodes and with an increasing number of nodes further accelerates in comparison with sequential algorithm. In this work are designed new scheduling criteria which are experimentally evaluated.