File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A cost-effective critical path approach for service priority selections in grid computing economy

TitleA cost-effective critical path approach for service priority selections in grid computing economy
Authors
KeywordsComputational Complexity
Critical Path Method (Cpm)
Grid Computing
Heuristic Algorithm
Internet Resources Pricing
Time-Cost Tradeoff
Issue Date2006
PublisherElsevier 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?
AbstractThe 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 Identifierhttp://hdl.handle.net/10722/177972
ISSN
2015 Impact Factor: 2.604
2015 SCImago Journal Rankings: 2.262
ISI Accession Number ID
References

 

DC FieldValueLanguage
dc.contributor.authorLin, Men_US
dc.contributor.authorLin, Zen_US
dc.date.accessioned2012-12-19T09:41:07Z-
dc.date.available2012-12-19T09:41:07Z-
dc.date.issued2006en_US
dc.identifier.citationDecision Support Systems, 2006, v. 42 n. 3, p. 1628-1640en_US
dc.identifier.issn0167-9236en_US
dc.identifier.urihttp://hdl.handle.net/10722/177972-
dc.description.abstractThe 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.languageengen_US
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/dssen_US
dc.relation.ispartofDecision Support Systemsen_US
dc.subjectComputational Complexityen_US
dc.subjectCritical Path Method (Cpm)en_US
dc.subjectGrid Computingen_US
dc.subjectHeuristic Algorithmen_US
dc.subjectInternet Resources Pricingen_US
dc.subjectTime-Cost Tradeoffen_US
dc.titleA cost-effective critical path approach for service priority selections in grid computing economyen_US
dc.typeArticleen_US
dc.identifier.emailLin, M: linm@hku.hken_US
dc.identifier.authorityLin, M=rp01075en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/j.dss.2006.02.010en_US
dc.identifier.scopuseid_2-s2.0-33750432504en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-33750432504&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume42en_US
dc.identifier.issue3en_US
dc.identifier.spage1628en_US
dc.identifier.epage1640en_US
dc.identifier.isiWOS:000242306600026-
dc.publisher.placeNetherlandsen_US
dc.identifier.scopusauthoridLin, M=55385535800en_US
dc.identifier.scopusauthoridLin, Z=10041296000en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats