dynamic and efficient resource allocation on cloud environment
j PraveenChander,M NAVEENA,S MADHUBALA,B ARUNA
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:2 Issue:1 Year: 08 February,2014 Pages:18-28
Abstract
In cloud environment dynamic resource allocation is a problematic situation .To resolve this problem, we propose a gossip protocol that ensures fair resource allocation on our sites and applications, dynamically scales and adapts both number of physical machines and allocation to the load changes. We present a protocol that computes an optimal solution without considering memory constraints and prove correctness and convergence properties. This gossip protocol provides an heuristic solution for minimizing the cost of allocation. This work will ensure continuous execution and don’t require global synchronization. In proposed system, we make a significant contribution towards engineering a resource management middleware for cloud environments.
Kewords
global synchronization
Reference
[1] M. Jelasity, A. Montresor, and O. Babaoglu, “Gossip-based aggregation in large dynamic networks,” ACM Trans. Computer Syst., vol. 23, no. 3, pp. 219–252, 2005. [2] ——, “T-Man: gossip-based fast overlay topology construction,” Computer Networks, vol. 53, no. 13, pp. 2321–2339, 2009. [3] F. Wuhib, R. Stadler, and M. Spreitzer, “Gossip-based resource management for cloud environments,” in 2010 International Conference on Network and Service Management. [4] F. Wuhib, M. Dam, R. Stadler, and A. Clem, “Robust monitoring of network-wide aggregates through gossiping,” IEEE Trans. Network and Service Management, vol. 6, no. 2, pp. 95–109, June 2009. R. L. Graham, “Bounds on multiprocessing timing anomalies,” SIAM J. Applied Mathematics, vol. 17, no. 2, pp. pp. 416–429, 1969. [5] C. Tang, M. Steinder, M. Spreitzer, and G. Pacifici, “A scalable application placement controller for enterprise data centers,” in 2007 International Conference on World Wide Web. [6] H. Shachnai and T. Tamir, “On two class-constrained versions of the multiple knapsack problem,”Algorithmica, vol. 29, no. 3, pp. 442–467, Dec. 2001. [7] G. B. Dantzig, “Discrete-variable extremum problems,” Operations Research, vol. 5, no. 2, pp. 266–288, 1957. [8] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web caching and Zipf-like distributions: evidence and implications,” inProc. 1999 Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1, pp. 126–134. [9] C. Adam and R. Stadler, “Service middleware for self-managing largescale systems,”IEEE Trans. Network and Service Management,vol.4, no. 3, pp. 50–64, Apr. 2008. [10] J. Famaey, W. De Cock, T. Wauters, F. De Turck, B. Dhoedt, and P. Demeester, “A latency-aware algorithm for dynamic service placement in large-scale overlays,” in 2009 International Conference on Integrated Network Management. [11] C. Low, “Decentralised application placement,”Future Generation Computer Systems, vol. 21, no. 2, pp. 281–290, 2005.
