Pricing in computer networks: motivation, formulation, and example
IEEE/ACM Transactions on Networking (TON)
An economic paradigm for query processing and data migration in mariposa
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Applying conflict management strategies in BDI agents for resource management in computational grids
ACSC '02 Proceedings of the twenty-fifth Australasian conference on Computer science - Volume 4
A Case for Economy Grid Architecture for Service-Oriented Grid Computing
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Resource Co-Allocation in Computational Grids
HPDC '99 Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing
A Scalable Protocol for Deadlock and Livelock Free Co-Allocation of Resources in Internet Computing
SAINT '03 Proceedings of the 2003 Symposium on Applications and the Internet
Market-based Proportional Resource Sharing for Clusters
Market-based Proportional Resource Sharing for Clusters
GARA: a uniform quality of service architecture
Grid resource management
A price-anticipating resource allocation mechanism for distributed shared clusters
Proceedings of the 6th ACM conference on Electronic commerce
Grid Resource Allocation and Task Scheduling for Resource Intensive Applications
ICPPW '06 Proceedings of the 2006 International Conference Workshops on Parallel Processing
Probabilistic advanced reservations for batch-scheduled parallel machines
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
VARQ: virtual advance reservations for queues
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Eliciting honest value information in a batch-queue environment
GRID '07 Proceedings of the 8th IEEE/ACM International Conference on Grid Computing
QBETS: queue bounds estimation from time series
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Algorithmic mechanism design for load balancing in distributed systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
| Hi-index | 0.02 |
This paper studies the optimal resource allocation in time-reservation systems. Customers arrive at a service facility and receive service in two steps; in the first step information is gathered from the customer, which is then sent to a pool of computing resources, and in the second step the information is processed after which the customer leaves the system. A central decision maker has to decide when to reserve computing power from the pool of resources, such that the customer does not have to wait for the start of the second service step and that the processing capacity is not wasted due to the customer still being serviced at the first step. The decision maker simultaneously has to decide on how many processors to allocate for the second processing step such that reservation and holding costs are minimized. Since an exact analysis of the system is difficult, we decompose the system into two parts which are solved sequentially leading to nearly optimal solutions. We show via dynamic programming that the near-optimal number of processors follows a step function with as an extreme policy the bang-bang control. Moreover, we provide new fundamental insights in the dependence of the near-optimal policy on the distribution of the information gathering times. Numerical experiments demonstrate that the near-optimal policy closely matches the performance of the optimal policy of the original problem.