File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.dss.2006.02.010
- Scopus: eid_2-s2.0-33750432504
- WOS: WOS:000242306600026
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A cost-effective critical path approach for service priority selections in grid computing economy
Title | A cost-effective critical path approach for service priority selections in grid computing economy |
---|---|
Authors | |
Keywords | Computational Complexity Critical Path Method (Cpm) Grid Computing Heuristic Algorithm Internet Resources Pricing Time-Cost Tradeoff |
Issue Date | 2006 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/dss |
Citation | Decision Support Systems, 2006, v. 42 n. 3, p. 1628-1640 How to Cite? |
Abstract | The increasing demand for grid computing resources calls for an incentive-compatible pricing mechanism for differentiated service qualities. This paper examines the optimal service priority selection problem for a grid computing services user, who is submitting a multi-subtask job for the priced services in a grid computing network. We conceptualize the problem into a prioritized critical path method (CPM) network, identify it as a time-cost tradeoff problem, and differentiate it from the traditional problem by considering a delay cost associated to the total throughput time. We define the optimal solution for the prioritized CPM network as the globally cost-effective critical path (GCCP), the optimal critical path for the solution that minimizes the total cost. As the exponential time complexity of GCCP makes the problem practically unsolvable, we propose a locally cost-effective critical path (LCCP) based approach to the prioritized CPM problem with a heuristic solution. The locally optimized priority constituting the configuration for LCCP can provide a lower bound for the throughput time of GCCP with the same time complexity as that for a traditional CPM problem. To further improve the quality of the solution, we conceive a priority adjustment algorithm named Non-critical Path Relaxation (NPR) algorithm, to refine the priority selections of the nodes on the non-critical paths. A discussion of the effects of the users' priority selections on the grid network pricing is provided to elicit future research on the computing resource pricing problem on the service-side. © 2006 Elsevier B.V. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/177972 |
ISSN | 2021 Impact Factor: 6.969 2020 SCImago Journal Rankings: 1.564 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, M | en_US |
dc.contributor.author | Lin, Z | en_US |
dc.date.accessioned | 2012-12-19T09:41:07Z | - |
dc.date.available | 2012-12-19T09:41:07Z | - |
dc.date.issued | 2006 | en_US |
dc.identifier.citation | Decision Support Systems, 2006, v. 42 n. 3, p. 1628-1640 | en_US |
dc.identifier.issn | 0167-9236 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/177972 | - |
dc.description.abstract | The increasing demand for grid computing resources calls for an incentive-compatible pricing mechanism for differentiated service qualities. This paper examines the optimal service priority selection problem for a grid computing services user, who is submitting a multi-subtask job for the priced services in a grid computing network. We conceptualize the problem into a prioritized critical path method (CPM) network, identify it as a time-cost tradeoff problem, and differentiate it from the traditional problem by considering a delay cost associated to the total throughput time. We define the optimal solution for the prioritized CPM network as the globally cost-effective critical path (GCCP), the optimal critical path for the solution that minimizes the total cost. As the exponential time complexity of GCCP makes the problem practically unsolvable, we propose a locally cost-effective critical path (LCCP) based approach to the prioritized CPM problem with a heuristic solution. The locally optimized priority constituting the configuration for LCCP can provide a lower bound for the throughput time of GCCP with the same time complexity as that for a traditional CPM problem. To further improve the quality of the solution, we conceive a priority adjustment algorithm named Non-critical Path Relaxation (NPR) algorithm, to refine the priority selections of the nodes on the non-critical paths. A discussion of the effects of the users' priority selections on the grid network pricing is provided to elicit future research on the computing resource pricing problem on the service-side. © 2006 Elsevier B.V. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/dss | en_US |
dc.relation.ispartof | Decision Support Systems | en_US |
dc.subject | Computational Complexity | en_US |
dc.subject | Critical Path Method (Cpm) | en_US |
dc.subject | Grid Computing | en_US |
dc.subject | Heuristic Algorithm | en_US |
dc.subject | Internet Resources Pricing | en_US |
dc.subject | Time-Cost Tradeoff | en_US |
dc.title | A cost-effective critical path approach for service priority selections in grid computing economy | en_US |
dc.type | Article | 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.doi | 10.1016/j.dss.2006.02.010 | en_US |
dc.identifier.scopus | eid_2-s2.0-33750432504 | en_US |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-33750432504&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 42 | en_US |
dc.identifier.issue | 3 | en_US |
dc.identifier.spage | 1628 | en_US |
dc.identifier.epage | 1640 | en_US |
dc.identifier.isi | WOS:000242306600026 | - |
dc.publisher.place | Netherlands | en_US |
dc.identifier.scopusauthorid | Lin, M=55385535800 | en_US |
dc.identifier.scopusauthorid | Lin, Z=10041296000 | en_US |
dc.identifier.issnl | 0167-9236 | - |