{'fraction_non_alphanumeric': 0.02025586353944563, 'fraction_numerical': 0.0021321961620469083, 'mean_word_length': 5.387755102040816, '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}}
Efficient Process Scheduling for Multi-core Systems

Machines with multiple cores have become more and more popular. In order to fully utilize their parallel computation ability, efficient scheduling algorithm plays an important role. A good scheduler should output the reasonably good result quickly but most of the current schedulers fail to achieve this goal and always have to compromise between the running time and result quality. In response to the above concerns, this paper proposes one algorithm, Longest Path First In (LPFI), to do scheduling efficiently and effectively for multi-core. This algorithm uses a deterministic allocation mechanism to prioritize processes which are in long dependency chain. The experiment results show that, compared with greedy scheduling algorithm, LPFI has around 10% improvement in the final result and can output the optimal result much faster than integer linear programming (ILP) scheduler.