The Community for Technology Leaders
2011 IEEE International Conference on Web Services (2011)
Washington, DC USA
July 4, 2011 to July 9, 2011
ISBN: 978-0-7695-4463-2
pp: 564-571
In Database-as-a-Service (DBaaS), a large number of tenants share DBaaS resources (CPU, I/O and Memory). While the DBaaS provider runs DBaaS to "share" resources across the entire tenant population to maximize resource utilization and minimize cost, the tenants subscribe to DBaaS at a low price point while still having resources conceptually "isolated" according to service level agreements (SLAs). To optimize this dichotomy of goals, we propose a dynamic resource allocation framework that periodically re-allocates resources to tenants to maximize resource utilization while tolerating a low risk of SLA violations. We model the resource allocation problem as a modified unbounded knapsack problem. The model introduces an additional fairness constraint to assign residual resources to active tenants, while avoiding that few tenants consume all residual resources. Performed experiments demonstrate the effectiveness and efficiency of the proposed allocation algorithm for a synthetic workload with burstiness and predicted tenant behavior.
DBaaS, multi-tenancy, dynamic resource allocation

Z. Wang et al., "A Dynamic Resource Allocation Algorithm for Database-as-a-Service," 2011 IEEE International Conference on Web Services(ICWS), Washington, DC USA, 2011, pp. 564-571.
96 ms
(Ver 3.3 (11022016))