Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple Q...Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple QoS constraint resource scheduling optimization in computational grid is distributed to two subproblems： optimization of grid user and grid resource provider. Grid QoS scheduling can be achieved by solving sub problems via an iterative algorithm.展开更多
A general scheduling framework (GSF) for independent tasks in computational Grid is proposed in this paper, which modeled by Petri net and located on the layer of Grid scheduler. Furthermore, a new mapping algorithm a...A general scheduling framework (GSF) for independent tasks in computational Grid is proposed in this paper, which modeled by Petri net and located on the layer of Grid scheduler. Furthermore, a new mapping algorithm aimed at time and cost is designed on the basis of this framework. The algorithm uses weighted average fuzzy applicability to express the matching degree between available machines and independent tasks. Some existent heuristic algorithms are tested in GSF, and the results of simulation and comparison not only show good flexibility and adaptability of GSF, but also prove that, given a certain aim, the new algorithm can consider the factors of time and cost as a whole and its performance is higher than those mentioned algorithms.展开更多
针对数据网格环境下的多QoS约束任务调度问题,提出了一种基于最早完成时间与QoS相识度的数据网格任务调度算法(data grid task scheduling algorithm based on Min-min and QoS similarity,MS-GTSA)。该算法将最早完成时间与S-GTSA算法...针对数据网格环境下的多QoS约束任务调度问题,提出了一种基于最早完成时间与QoS相识度的数据网格任务调度算法(data grid task scheduling algorithm based on Min-min and QoS similarity,MS-GTSA)。该算法将最早完成时间与S-GTSA算法相结合,在任务调度过程中,选取任务QoS约束与资源QoS匹配最佳,且完成时间最早的一项优先进行调度。在满足任务最佳QoS匹配的同时,时间跨度得到了较大的改善。仿真结果表明,该算法有效降低了任务调度的时间跨度,在综合性能上较S-GTSA算法有所提高。展开更多
基金the National Natural Science Foundation of China (60402028, 60672137) Wuhan Yonger Dawning Foundation (20045006071-15)China Specialized Research Fund for the Doctoral Program of Higher Eduction (20060497015).
文摘Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple QoS constraint resource scheduling optimization in computational grid is distributed to two subproblems： optimization of grid user and grid resource provider. Grid QoS scheduling can be achieved by solving sub problems via an iterative algorithm.
基金Project (60433020) supported by the National Natural Science Foundation of China project supported by the Postdoctor-al Science Foundation of Central South University
文摘A general scheduling framework (GSF) for independent tasks in computational Grid is proposed in this paper, which modeled by Petri net and located on the layer of Grid scheduler. Furthermore, a new mapping algorithm aimed at time and cost is designed on the basis of this framework. The algorithm uses weighted average fuzzy applicability to express the matching degree between available machines and independent tasks. Some existent heuristic algorithms are tested in GSF, and the results of simulation and comparison not only show good flexibility and adaptability of GSF, but also prove that, given a certain aim, the new algorithm can consider the factors of time and cost as a whole and its performance is higher than those mentioned algorithms.
文摘针对数据网格环境下的多QoS约束任务调度问题,提出了一种基于最早完成时间与QoS相识度的数据网格任务调度算法(data grid task scheduling algorithm based on Min-min and QoS similarity,MS-GTSA)。该算法将最早完成时间与S-GTSA算法相结合,在任务调度过程中,选取任务QoS约束与资源QoS匹配最佳,且完成时间最早的一项优先进行调度。在满足任务最佳QoS匹配的同时,时间跨度得到了较大的改善。仿真结果表明,该算法有效降低了任务调度的时间跨度,在综合性能上较S-GTSA算法有所提高。
