Towards a Load Balancing in a three-level cloud computing network
Authors:
- 1 July 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 108-113
Abstract
Network bandwidth and hardware technology are developing rapidly, resulting in the vigorous development of the Internet. A new concept, cloud computing, uses low-power hosts to achieve high reliability. The cloud computing, an Internet-based development in which dynamically scalable and often virtualized resources are provided as a service over the Internet has become a significant issue. The cloud computing refers to a class of systems and applications that employ distributed resources to perform a function in a decentralized manner. Cloud computing is to utilize the computing resources (service nodes) on the network to facilitate the execution of complicated tasks that require large-scale computation. Thus, the selecting nodes for executing a task in the cloud computing must be considered, and to exploit the effectiveness of the resources, they have to be properly selected according to the properties of the task. However, in this study, a two-phase scheduling algorithm under a three-level cloud computing network is advanced. The proposed scheduling algorithm combines OLB (Opportunistic Load Balancing) and LBMM (Load Balance Min-Min) scheduling algorithms that can utilize more better executing efficiency and maintain the load balancing of system.Keywords
This publication has 8 references indexed in Scilit:
- Scientific Cloud Computing: Early Definition and Experience2008
- An approach to a Cloud Computing network2008
- Cloud computing — Issues, research and implementations2008
- A hybrid load balancing policy underlying grid computing environmentComputer Standards & Interfaces, 2007
- Grapes: topology-based hierarchical virtual network for peer-to-peer lookup services2003
- Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet2002
- The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions2002
- A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing SystemsJournal of Parallel and Distributed Computing, 2001