File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A cost-effective critical path approach for service priority optimization in the grid computing economy
Title | A cost-effective critical path approach for service priority optimization in the grid computing economy |
---|---|
Authors | |
Keywords | Computing Power Economy Grid Computing Network Resource Pricing Pert/Cpm Quality Of Service Time-Cost Tradeoff |
Issue Date | 2004 |
Citation | International Conference On Information Technology: Coding Computing, Itcc, 2004, v. 2, p. 100-104 How to Cite? |
Abstract | The advancement in the utilization and technologies of the Internet has led to the rapid growth of grid computing; and the perpetuating demand for grid computing 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-minimizing priority 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 noncritical paths with respect to a given critical path. |
Persistent Identifier | http://hdl.handle.net/10722/178345 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, M | en_US |
dc.contributor.author | Lin, Z | en_US |
dc.date.accessioned | 2012-12-19T09:46:45Z | - |
dc.date.available | 2012-12-19T09:46:45Z | - |
dc.date.issued | 2004 | en_US |
dc.identifier.citation | International Conference On Information Technology: Coding Computing, Itcc, 2004, v. 2, p. 100-104 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/178345 | - |
dc.description.abstract | The advancement in the utilization and technologies of the Internet has led to the rapid growth of grid computing; and the perpetuating demand for grid computing 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-minimizing priority 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 noncritical paths with respect to a given critical path. | en_US |
dc.language | eng | en_US |
dc.relation.ispartof | International Conference on Information Technology: Coding Computing, ITCC | en_US |
dc.subject | Computing Power Economy | en_US |
dc.subject | Grid Computing | en_US |
dc.subject | Network Resource Pricing | en_US |
dc.subject | Pert/Cpm | en_US |
dc.subject | Quality Of Service | en_US |
dc.subject | Time-Cost Tradeoff | en_US |
dc.title | A cost-effective critical path approach for service priority optimization in the grid computing economy | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Lin, M: linm@hku.hk | en_US |
dc.identifier.authority | Lin, M=rp01075 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.scopus | eid_2-s2.0-3042523871 | en_US |
dc.identifier.volume | 2 | en_US |
dc.identifier.spage | 100 | en_US |
dc.identifier.epage | 104 | en_US |
dc.identifier.scopusauthorid | Lin, M=55385535800 | en_US |
dc.identifier.scopusauthorid | Lin, Z=10041296000 | en_US |