{'fraction_non_alphanumeric': 0.027418126428027417, 'fraction_numerical': 0.0, 'mean_word_length': 5.704081632653061, '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}}
Differential evolution with double-level archives for bi-objective cloud task scheduling

In cloud computing, scheduling plays a critical role for quality of service (QoS) and provider efficiency which are generally measured by several metrics and make the scheduling a multiobjective problem (MOP). In this paper, we propose a differential evolution algorithm with double-level archives (DE-DLA) for bi-objective cloud task scheduling. The proposed algorithm is based on the newly-developed framework, multiobjective evolutionary algorithm with double-level archives (MOEA-DLA), and uses differential evolution to implement this framework. Global Archive is used to save Pareto-optimal individuals for the whole problem and Sub-archive is used to save several comparatively good individuals for the corresponding sub-problem formed by decomposition. So the algorithm takes advantages of both whole multiobjective problem optimization and decomposition based optimization. Precedence constraint in user's application is considered in the scheduling model of this paper. To minimize cost and makespan simultaneously, the proposed algorithm tries to find optimal resource allocation and optimal order of task executing. In the experiment, compared with two other algorithms, DE-DLA has shown competitive advantages.