In:
Concurrency and Computation: Practice and Experience, Wiley, Vol. 28, No. 5 ( 2016-04-10), p. 1399-1416
Abstract:
We consider a large‐scale online service system of placing resources geographically distributed over multiple regional cloud data centers. Service providers need to place the resources in these regions so as to maximize profit, accounting for demand granting revenues minus resource placement costs. The challenge is how to optimally place these resources to fulfill varying demands (e.g., multidimensional and stochastic demands) among these cloud data centers. Considering demand stochasticity will significantly increase time complexity of resource placement algorithm, resulting in inefficiency when handling a large number of resources. We propose a fast resource placement algorithm (FRP) to obtain the maximum resource revenue from distributed cloud systems. Experiments show that in scenarios with general settings, FRP can achieve up to 99.2% revenue of existed best solution while reducing execution time by two orders of magnitude. Therefore, FRP is an effective supplement to existing algorithms under time‐tense scheduling scenarios with a large number of resources. Copyright © 2015 John Wiley & Sons, Ltd.
Type of Medium:
Online Resource
ISSN:
1532-0626
,
1532-0634
Language:
English
Publisher:
Wiley
Publication Date:
2016
detail.hit.zdb_id:
2052606-4
SSG:
11
Permalink
