Papers by Keyword: Load Balance

Abstract: In this paper, we propose an improved routing algorithm to prolong network lifetime of wireless sensor networks (WSNs) by combining the shortest hop routing tree (SHORT) algorithm and the, turn off redundant node (TORN) MAC layer protocol to cross layer SHORTORN scheme. Moreover, to prolong the lifetime of the first node death (FND) in networks, the rate of energy consumption should be balanced for all nodes. Therefore, this paper further proposes a load balancing SHORTORN scheme by combining the weight and energy-aware, called energy-aware weight-based SHORTORN (EWSHORTORN). The proposed EWSHORTORN algorithm lets more nodes share the load of the leader and balances the opportunity of data relaying to all nodes. The proposed load balancing scheme allocates energy consumption load to be more uniformly among all nodes, thus the FNL can be prolonged evidently. Simulation results show that the proposed EWSHORTORN outperforms the SHORT scheme with double lifetime of FND.Keywords: wireless sensor networks, network lifetime, cross layer protocol, load balance.

Abstract: LEACH is a classic wireless network routing protocol, the large energy consumption of LEACH cluster heads leads to the load imbalance of network nodes in order to shorten the life of network, the paper proposed an improved LEACH-M protocol to solve the problem, so that the shortest path between cluster heads and base station is formed, finally the NS2 simulation results show that the load balance of network is improved, and the lifetime of network is extended.

Abstract: To reduce the number of inter-disturb access points and the interference among access points in same channel, with research on interference issus and channel assignment algorithms of wireless local area network, a scheme suitable for centralized wireless local area network was proposed aiming to minimize the total interference among access points, which comprehensively considerate the number of neighbor and the received power. And then the algorithm with cases was simulated and analyzed, the result of NS2 simulation indicated that the algorithm was simple, effective and feasible, which could realize dynamic adjustment to the wireless LAN RF channel and had a better load balance effect among non-overlapping channels.

Abstract: In the rolling process, the upper and lower working rolls of the mill usually under different load. In order to keep good product quality, load balance control is necessary. This paper proposes a control method which uses the torque difference between upper and lower roll to compensate the given current of the upper roll motor. Simulation results show that the proposed control method can give good control effect and keep load balance.

Abstract: With the enlargement of the test scale, the examination system has become the direction of large-scale. Large-scale examination system has advantage over the calculation in a cloud environment. But more candidates and examinations lead to network congestion. On the solutions of network congestion, there has been a lot of wan processing methods. But they are not suitable for application to run in the LAN's examination system according to actual condition. Therefore, this paper will introduce an improved method of multi-source multipath to alleviate the burden to the public network channel in the process of network data transmission. In order to improve the stability of the system by optimizing software to reduce the dependence on hardware. In the end, this paper will discuss the performance of this strategy.

Abstract: By analyzing the advantages and disadvantages of the existing dynamic message routing model in ESB,propose a new dynamic message routing model based on load balance. This paper applied the message routing components in the Enterprise Integration Patterns to the routing model of ESB.By using abstract routing table and real-time service monitoring and load balance strategy,the system efficiency has been improved.The experimental results demonstrate the effectiveness of this model.

Abstract: Speculative Multithreading (SpMT) technology is an effective mechanism for automatic parallelization of irregular programs. While speculative parallelization can potentially deliver significant speedup for irregular applications, several speculative parallelization overheads resulting from the factors, especially inter-thread load imbalance, limit these speedups in practice. Most existing thread partitioning methods are mainly based on heuristic rules strategies to generate speculative threads. However, these heuristic rules extracted from people’s experiences cannot estimate quantitatively but qualitatively the overhead. Based on the thorough analysis of the speculative parallelization overhead resulting from inter-thread load imbalance, we propose a novel method to balance the inter-thread load. In this method, we firstly determine a method by which to unroll the loops. Then, we introduce cluster method to search the solution space of speculative threads and finally get the optimal solution. The experimental results show that, the proposed method can effectively reduce the inter-thread load imbalance; and the load imbalance overhead can be effectively reduced by 43.7%. And we can gain 8.8% performance improvement on Olden benchmark suits.

Abstract: Clonal operator which can reserve the elites is introduced in the selection step of traditional genetic algorithm (GA) to accelerate the local convergence speed. Chaotic search which is randomness and ergodicity is applied in crossover and mutation operators to avoid the algorithm stopping at a local extreme value. The above hybrid GA is called chaotic clonal GA (CCGA) which can overcome the instability of optimizing processes and results in traditional GA by the certainty of chaotic trajectory. The CCGA is applied to solve the problem of load balance routing in differentiated service networks. The routing optimization model is created and the optimizing objective is load balance and small path length. The simulation results show that CCGA has fast convergence speed and high stability. It can meet the requirements of important business routings.

Abstract: In recent years, the rapid development of cloud computing brings significant innovation in the whole IT industry. For the local tasks scheduling on each computational node of the top model of weapon network, an open task scheduling framework was introduced a task accept control scheme based on the tasks based on load balancing, quality of service (QoS) and an improved constant bandwidth server algorithm was presented. The result of simulation shows that the scheduling policies can improve the schedule speed when the number of tasks increases and can meet the demand better for the real time requirementsof the tactical training evaluation system for complexity and Large-scale.

Abstract: In order to make up for the shortage of Min-Min in load balancing, a new task scheduling algorithm T-Max-Int Under the grid computing has been proposed in this paper. In T-Max-Int, the Loss Degree of Max-Int has been brought into Min-Min. T was in the form of percentage, which represents the proportion of selected tasks that have loss degree in the total tasks. Then, experiments of T have been taken to make Makespan the minimum. Finally, T-Max-Int, Max-Min, Min-Min were compared, which proved that T-Max-Min is better than the other two algorithms in aspects of Makespan and load balancing.