Fig 2 - uploaded by Chunkyun Youn
Content may be subject to copyright.
Source publication
Load balancing is one of the best efficient methods for performance improvement of cluster system. Recently, WLC algorithm is used for the load balancing of cluster system. But, the algorithm also has load imbalance between servers, because it uses inaccurate static load status of servers. In this paper, I suggest a more efficient dynamic load bala...
Similar publications
Modern large distributed applications, such as telecommunication and banking services, need to respond instantly to a huge
number of queries within a short period of time. The data-intensive, query-intensive nature makes it necessary to build these
applications in a distributed data environment that involves a number of data servers sharing service...
The term "cloud computing" describes the services and programmes that data centres make available to users all over the world. Online access is provided for all services and programmes. Virtualization is a crucial component of the cloud computing environment, and virtual machine migration is one of its key components. Virtual machine migration is t...
A key challenge in designing load balancing strategies is to achieve low delay in large-scale systems while only using minimal communication overhead. Motivated by these issues, we introduce a novel scheme in which the dispatcher becomes aware of idle servers without any explicit communication from either side, using absence of messages at predefin...
Load balancing in cloud computing is an important management and scheduling issue; because, in cloud computing environment, each user may face with hundreds of virtual resources for running each task. Thus, selecting the best resource for performing the task is one of the most important challenges. Various load balancing algorithms have been propos...
Citations
... Ye studying the processing time of historic tasks in the heterogeneous cluster system, further proposed a load scheduling algorithm [7]. In addition the relevant scheduling algorithm for load balancing is studied in Literature [8][9][10][11][12]. Whereas the object of the algorithms is homogeneous cluster system, with few studies on heterogeneous cluster. ...
Job scheduling strategy of rendering was studied according to the scheduling model of heterogeneous cluster rendering system. Then, the work proposed the job scheduling strategy for heterogeneous cluster rendering as follows: Definition of load balancing measurement, influencing factors of model, construction of job scheduling model based on cluster rendering, and dynamic algorithm design based on genetic algorithm. The heterogeneous cluster rendering system achieved the effective scheduling algorithm for load balancing. The simulation results showed the algorithm had good load balancing. The work proposes the theoretical basis and new idea for resource scheduling of cluster system and cloud platform as well as the support for the effective use of resources. It has great significance.
... In [7], a dynamic load balancing algorithm based on various load status information of servers is proposed. Information such as CPU load, memory and network load are considered. ...
Minimizing energy consumption of computing systems is a complex problem with many parameters. Clusters have been studied from a performance perspective and more recently from a power consumption angle. Since clusters are usually composed of different hardware with different performance and energy consumption, we propose load balancing policies that take into account servers' computational power and power consumption. These policies are applied on a heterogeneous power-aware DVFS cluster running hard real-time CPU intensive tasks. Proposed policies are compared to the Earliest Deadline First policy. Simulation results show that these policies achieve higher energy savings and less task transfers at the same time.
... It is importance of multicast communication in distributed and parallel systems. Recently, the technique has been employed in many fields [2][3][4][5]: ...
How to effectively distribute service replicas to its n nodes is of much importance in distributed and parallel systems. In many cases, the service replicas are randomly placed, and some service replicas have no relation to any nodes in which they are. So these service replicas are very difficultly accessed, and the flexibility of the system is poor. This paper presents such a novel service replicas distribution scheme. Instead of traditional method, this scheme is mainly based on the group structure that makes every node relate to the characteristics of the service replicas. The proposed scheme is very flexible to change the structures of the service applications. So the scheme can be employed to many scenarios where service replicas are needed.
