A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy
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 ser...
Saved in:
Main Authors: | , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2006
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/1718 http://dx.doi.org/10.1016/j.dss.2006.02.010 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-2717 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-27172013-03-15T10:12:03Z A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy LIN, Mei Lin, Z. 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-01-01T08:00:00Z text https://ink.library.smu.edu.sg/sis_research/1718 info:doi/10.1016/j.dss.2006.02.010 http://dx.doi.org/10.1016/j.dss.2006.02.010 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Grid computing Internet resources pricing Critical path method (CPM) Time–cost tradeoff Heuristic algorithm Computational complexity Computer Sciences Management Information Systems |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Grid computing Internet resources pricing Critical path method (CPM) Time–cost tradeoff Heuristic algorithm Computational complexity Computer Sciences Management Information Systems |
spellingShingle |
Grid computing Internet resources pricing Critical path method (CPM) Time–cost tradeoff Heuristic algorithm Computational complexity Computer Sciences Management Information Systems LIN, Mei Lin, Z. A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
description |
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. |
format |
text |
author |
LIN, Mei Lin, Z. |
author_facet |
LIN, Mei Lin, Z. |
author_sort |
LIN, Mei |
title |
A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
title_short |
A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
title_full |
A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
title_fullStr |
A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
title_full_unstemmed |
A Cost-Effective Critical Path Approach for Service Priority Selections in a Grid Computing Economy |
title_sort |
cost-effective critical path approach for service priority selections in a grid computing economy |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2006 |
url |
https://ink.library.smu.edu.sg/sis_research/1718 http://dx.doi.org/10.1016/j.dss.2006.02.010 |
_version_ |
1770571457430028288 |