A Cost-Effective Critical Path Approach for Service Priority Optimization in the Grid Computing Economy

• Main Authors: LIN, Mei, LIN, Zhangxi
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2004
• Subjects: Computer Sciences; Management Information Systems
• Online Access: https://ink.library.smu.edu.sg/sis_research/1726; https://ink.library.smu.edu.sg/context/sis_research/article/2725/viewcontent/LinMei_2004_CostEffectiveCriticalPath.pdf
• Institution: Singapore Management University

The advancement in the utilization and technologiesof the Internet has led to the rapid growth of gridcomputing; and the perpetuating demand for gridcomputing resources calls for an incentive-compatible solution to the imminent QoS problem. This paper examines the optimal service priority selection problem that a grid computing network user will confront. We model grid services for a multi-subtask request as a prioritized PERT graph and prove that the localized conditional critical path, which is based on the cost-minimizin gpriority selection for each node, sets the lower bound for the length of cost-effective critical path that commits the optimal solution. We also propose a heuristic algorithm for relaxing the nodes on the non-criticalpaths with respect to a given critical path.