Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
4-2004
Abstract
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.
Discipline
Computer Sciences | Management Information Systems
Research Areas
Information Systems and Management
Publication
ITCC '04: Proceedings of the International Conference on Information Technology: Coding and Computing: April 5-7, 2004, Las Vegas
First Page
100
Last Page
104
ISBN
9780769521084
Identifier
10.1109/ITCC.2004.1286597
Publisher
IEEE Computer Society
City or Country
Los Alamitos, CA
Citation
LIN, Mei and LIN, Zhangxi.
A Cost-Effective Critical Path Approach for Service Priority Optimization in the Grid Computing Economy. (2004). ITCC '04: Proceedings of the International Conference on Information Technology: Coding and Computing: April 5-7, 2004, Las Vegas. 100-104.
Available at: https://ink.library.smu.edu.sg/sis_research/1726
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
http://doi.ieeecomputersociety.org/10.1109/ITCC.2004.1286597