A dynamic bidirectional matching method of tasks and resources oriented to wide-area distributed computing

Due to the huge capacities of computing and storage resources, wide-area distributed computing environment has become important infrastructures supporting computing power and data interconnection.In wide-area distributed computing environment, matching of tasks and resources is important to improve system performance.However, the diversity of tasks and resources and the geographical dispersion of resources increase the complexity of matching problems.To solve the problems of high response delay and low matching efficiency, a dynamic bidirectional matching method of tasks and resources oriented to wide-area distributed computing environments is proposed.The matching process is simplified and the response delay is mitigated by building a unified task requirement model and resource capability model.Moreover, the task-oriented and resource-oriented matching degrees are defined to express the preference of task-perspective and resource-perspective; the two-side comprehensive matching degree of tasks and resources is defined by the trade-off of the task-oriented and resource-oriented matching degree.The two-side comprehensive matching degrees are dynamically calculated for each task group and the resources to improve the matching quality.The experimental results show that the proposed method can effectively promoting the matching quality and significantly reduce the response delay compared with the existing methods.