An effective selection policy for load balancing in software DSM

2002 ◽  
Author(s):  
Tyng-Yeu Liang ◽  
Ce-Kuen Shieh ◽  
Jun-Qi Li
Keyword(s):  
Load Balancing ◽  
Selection Policy ◽  
Software Dsm ◽  
Effective Selection

scholarly journals Thread-Aware Mechanism to Enhance Inter-Node Load Balancing for Multithreaded Applications on NUMA Systems

2021 ◽  
Vol 11 (14) ◽  
pp. 6486
Author(s):  
Mei-Ling Chiang ◽  
Wei-Lun Su
Keyword(s):  
Load Balancing ◽  
Critical Path ◽  
Selection Procedure ◽  
Remote Memory ◽  
Data Mapping ◽  
Linux Kernel ◽  
Access Memory ◽  
Selection Policy ◽  
Benchmark Suite ◽  
Thread Mapping

NUMA multi-core systems divide system resources into several nodes. When an imbalance in the load between cores occurs, the kernel scheduler’s load balancing mechanism then migrates threads between cores or across NUMA nodes. Remote memory access is required for a thread to access memory on the previous node, which degrades performance. Threads to be migrated must be selected effectively and efficiently since the related operations run in the critical path of the kernel scheduler. This study focuses on improving inter-node load balancing for multithreaded applications. We propose a thread-aware selection policy that considers the distribution of threads on nodes for each thread group while migrating one thread for inter-node load balancing. The thread is selected for which its thread group has the least exclusive thread distribution, and thread members are distributed more evenly on nodes. This has less influence on data mapping and thread mapping for the thread group. We further devise several enhancements to eliminate superfluous evaluations for multithreaded processes, so the selection procedure is more efficient. The experimental results for the commonly used PARSEC 3.0 benchmark suite show that the modified Linux kernel with the proposed selection policy increases performance by 10.7% compared with the unmodified Linux kernel.

scholarly journals Agent Based Load Balancing in Grid Computing

2020 ◽  
Author(s):  
Wided Ali ◽  
Fatima Bouakkaz
Keyword(s):  
Load Balancing ◽  
Heterogeneous Systems ◽  
Agent Based ◽  
Selection Policy ◽  
Development Framework ◽  
Policy Selection ◽  
Proposed Model ◽  
Multi Agent ◽  
Location Policy ◽  
System Characteristics

Load-Balancing is an important problem in distributed heterogeneous systems. In this paper, an Agent-based load-balancing model is developed for implementation in a grid environment. Load balancing is realized via migration of worker agents from overloaded resources to underloaded ones. The proposed model purposes to take benefit of the multi-agent system characteristics to create an autonomous system. The Agent-based load balancing model is implemented using JADE (Java Agent Development Framework) and Alea 2 as a grid simulator. The use of MAS is discussed, concerning the solutions adopted for gathering information policy, location policy, selection policy, worker agents migration, and load balancing.

An Agent-Based Load Balancing Approach for RFID MiddleWares

2014 ◽  
Vol 541-542 ◽  
pp. 1458-1462
Author(s):  
Zhen Gang Wei ◽  
Xi Zhou Sun ◽  
Xiao Hua Wang
Keyword(s):  
Load Balancing ◽  
Mobile Agent ◽  
Load Transfer ◽  
Independent Set ◽  
Policy Transfer ◽  
Transfer Policy ◽  
Selection Policy ◽  
Policy Selection ◽  
Local Host ◽  
Location Policy

For company to extend their RFID applications ceaselessly, the fundamental challenge is how to satisfy enterprise applications more effectively, while avoids mainframe server purchased and existed servers leave unused. It needs to decentralize work by using several RFID middlewares. So load balancing method is required for preventing centralization work in certain RFID middleware. In this paper, as a solution of tackle the challenge, we proposed a new load balancing approach based on mobile agent for RFID middlewares, which includes: information gathering policy, transfer policy, selection policy and location policy, and three agents are developed: load-info monitoring agent (LIMA) compliant to monitoring local host workload status; load-info gathering agent (LIGA) compliant to gather local and global load information; load transfer mobile agent (LTMA) compliant to choose the independent set and the appropriate scheduling scheme and implement the relocation work.

Task Scheduling Algorithm based on Resources Segregation in Cloud Environment

2018 ◽  
pp. 96-101
Author(s):  
Shailendra Raghuvanshi ◽  
Priyanka Dubey
Keyword(s):  
Load Balancing ◽  
Task Scheduling ◽  
Waiting Time ◽  
Virtual Machines ◽  
Scheduling Algorithm ◽  
Cloud Environment ◽  
Task Scheduling Algorithm ◽  
Machine Utilization ◽  
Independent Tasks ◽  
Optimal Machine

Load balancing of non-preemptive independent tasks on virtual machines (VMs) is an important aspect of task scheduling in clouds. Whenever certain VMs are overloaded and remaining VMs are under loaded with tasks for processing, the load has to be balanced to achieve optimal machine utilization. In this paper, we propose an algorithm named honey bee behavior inspired load balancing, which aims to achieve well balanced load across virtual machines for maximizing the throughput. The proposed algorithm also balances the priorities of tasks on the machines in such a way that the amount of waiting time of the tasks in the queue is minimal. We have compared the proposed algorithm with existing load balancing and scheduling algorithms. The experimental results show that the algorithm is effective when compared with existing algorithms. Our approach illustrates that there is a significant improvement in average execution time and reduction in waiting time of tasks on queue using workflowsim simulator in JAVA.

Development of Load Balancing Systems in a Parallel MRP System

2003 ◽  
Vol 123 (10) ◽  
pp. 1847-1857
Author(s):  
Takahiro Tsukishima ◽  
Masahiro Sato ◽  
Hisashi Onari
Keyword(s):  
Load Balancing
Sign in / Sign up

Export Citation Format

Share Document