{'fraction_non_alphanumeric': 0.02822085889570552, 'fraction_numerical': 0.0, 'mean_word_length': 5.743801652892562, '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}}
MRMT: An algorithm of matching resource for multi-tasks

While most of work on task-resource matching in centreless network has focus on evaluating multi-QoS constraints in quantity, our work addresses this problem from types of QoS constraints, objectivity of matching process, and concurrency of multiple matches. An algorithm of matching resources for multi-tasks synchronously, MRMT, is presented. Firstly, an improved analytic hierarchy process (AHP) method is introduced. Secondly, the Gale-Shapley principle and methods are applied to optimize synchronous matches. The algorithm MRMT is preventive for accumulation of inconsistency with multi-QoS constraints, is especially effective for selecting optimal resources synchronously, and is available for maximizing efficiency for matched resources as possible.