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.