• Journal of Internet Technology
• /
• v.20 no.1
• /
• pp.293-300
• /
• 2019

The Internet of Things (IoT) enables embedded devices to connect to the internet either through IP or the web in a physical environment. The increase in performance of wireless access services, adaptive load balancing, and interference routing metric becomes the key challenges in Wireless Mesh Networks (WMN). However, in the case of IoT over WMN, a large number of users generate abundant net flows, which can result in network traffic jam. Therefore, in this paper, we propose a Load Balancing and Interference Delay Aware routing metric algorithm to efficiently address the issues present in the current work. The proposed scheme efficiently utilizes the available mesh station queue information and the number of mesh stations suffering from channel interference in the available path. The simulations results show that the proposed scheme performed superior to the existing routing metrics present in the current literature for similar purposes.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.176-179
• /
• 2002

In recent years, an increasing amount of computer network research has focused on the problem of cluster system in order to achieve higher performance and lower cost. The load unbalance is the major defect that reduces performance of a cluster system that uses parallel program in a form of SPMD (Single Program Multiple Data). Also, the load unbalance is a problem of MPP (Massive Parallel Processors), and distributed system. The cluster system is a loosely-coupled distributed system, therefore, it has higher communication overhead than MPP. Dynamic load balancing can solve the load unbalance problem of cluster system and reduce its communication cost. The cluster systems considered in this paper consist of P heterogeneous nodes connected by a switch-based network. The master node can predict the average execution time of tasks for each slave node based on the information from the corresponding slave node. Then, the master node redistributes remaining tasks to each node considering the predicted execution time and the communication overhead for task migration. The proposed dynamic load balancing uses execution time prediction to optimize the task redistribution. The various performance factors such as node number, task number, and communication cost are considered to improve the performance of cluster system. From the simulation results, we verified the effectiveness of the proposed dynamic load balancing algorithm.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.1
• /
• pp.1-8
• /
• 2016

We proposed a load unbalancing scheduling method for energy-efficient multi-core embedded systems considering DVFS (Dynamic Voltage/Frequency Scaling) power consumption and task characteristics. It is a new kind of scheduler which combines load balancing and load unbalancing technique. The purpose of the method is to effectively utilize energy without much effect in performance. In this paper, we conduct experiments on energy consumption and performance using the previous load balancing and unbalancing techniques and our proposed technique. The proposed technique reduced energy consumption more than 13.7% when compared to other algorithms. As a result, the proposed technique shows low energy consumption without much decline in the performance and is adequate for energy-efficient multi-core embedded systems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.7
• /
• pp.714-719
• /
• 2011

This paper proposes a scheme for distributed load balancing in mobile communication networks based on supervisory control framework. Using load information exchanged with neighboring cells, the "supervisors" that reside in the base stations distribute load among cells by controlling handover parameters in a distributed manner. The supervisors are designed so that the load difference among neighboring cells are kept under a pre-defined value. Results from systematic analysis and simulation indicate that our scheme effectively balances traffic load among cells and reduces call blocking rate of the overloaded cells.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.42 no.5
• /
• pp.361-367
• /
• 2014

In this paper, task scheduling and load balancing methods of multifrontal solution methods of finite element structural analysis in a modern multicore machine are introduced. Many structural analysis problems have generally irregular grid and many kinds of properties and materials. These irregularities and heterogeneities lead to bottleneck of parallelization and cause idle time to analysis. Therefore, task scheduling and load balancing are desired to reduce inefficiency. Several kinds of multithreaded parallelization methods are presented and comparison between static and dynamic task scheduling are shown. To reduce the idle time caused by irregular partitioned subdomains, computational load balancing methods, Balancing all tasks and minmax task pairing balancing, are invented. Theoretical and actual elapsed time are shown and the reason of their performance gap are discussed.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.49-56
• /
• 2004

Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes cannot adequately manage to balance parallel tasks generated from a single application. Dynamic loop scheduling methods are known to be useful in balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for the relatively small number of processors in a network of workstations because of order-of-magniture differences in communication overheads. Moreover, improvements of basis loops scheduling methods have not effectively dealt with irregularly distributed workloads in parallel loops, which commonly occur in applications for a network of workstation. In this paper, we present a new reconfigurable and decentralized balancing method for parallel loops on a network of workstations. Since our method supplements performance balancing with those tranditional load balancing methods, it minimizes the overall execution time.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

• The KIPS Transactions:PartC
• /
• v.13C no.5 s.108
• /
• pp.621-626
• /
• 2006

A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.105-112
• /
• 2011

We propose an adaptive load balancing scheme to transport real-time video streams efficiently in this paper. The playback buffer level of a video requesting client is high or low temporarily in mobile environment. This scheme attempts to allocate more network bandwidth to serve a video request with the lower buffer level preferentially. In this scheme, the amount of network bandwidth is dynamically allocated to the requesting clients according to their playback buffer levels in a distributed mobile system. In order to improve the quality of service and real-time performance of individual video playback, the proposed load balancing scheme tries to maximize the number of frames that are transported successfully to the client prior to their playback times. Fair services can also be provided to all the concurrent clients by making their playback situation more adaptive. The performance of this load balancing scheme is compared with that of other static load balancing scheme through extensive simulation experiments, resulting in the higher ratio of frames transmitted successfully within given deadlines.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.9
• /
• pp.513-520
• /
• 2003

Service restoration is an emergency control in distribution constrol centers to restore out-of-service area as soon as possible when a fault occurs in distribution networks. therefore, it requires fast computation time and high quality solutions for load balancing. In this paper. a load balance index and heuristic guided best-first search are proposed for these problem. The proposed algorithm consists of two parts. One is to set up a decision tree to represent the various switching operations available. Another is to identify the most effective the set of switches using proposed search technique and a load balance index. Test results on the KEPCO's 108 bus distribution system show that the performance is efficient and robust.