Introduction to operations research, 4th ed.
Introduction to operations research, 4th ed.
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
Mathematics of Operations Research
Managing computing resources in intranets: an electronic commerce perspective
Decision Support Systems - Special issue on economics of electronic commerce
The economics of network management
Communications of the ACM
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
A computational economy for grid computing and its implementation in the Nimrod-G resource broker
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
Architecture Requirements for Commercializing Grid Resources
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Authorization of a QoS path based on generic AAA
Future Generation Computer Systems - iGrid 2002
Performance evaluation of market-based resource allocation for Grid computing: Research Articles
Concurrency and Computation: Practice & Experience - Middleware for Grid Computing
Analyzing Market-Based Resource Allocation Strategies for the Computational Grid
International Journal of High Performance Computing Applications
Deadline division-based heuristic for cost optimization in workflow scheduling
Information Sciences: an International Journal
Cloud computing - The business perspective
Decision Support Systems
Research on the optimization decision-making two row-sequencing-pairs of activities with slacks
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
| Hi-index | 0.00 |
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 Noncritical 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.