A Load Balancing Strategy for Prioritized Execution of Tasks
نویسندگان
چکیده
Load balancing is a critical factor in achieving optimal performance in parallel applications where tasks are created in a dynamic fashion. In many computations , such as state space search problems, tasks have priorities, and solutions to the computation may be achieved more eeciently if these priorities are adhered to in the parallel execution of the tasks. For such tasks, a load balancing scheme that only seeks to balance load, without balancing high priority tasks over the entire system, might result in the concentration of high priority tasks (even in a balanced-load environment) on a few processors, thereby leading to low priority work being done. In such situations a load balancing scheme is desired which would balance both load and high priority tasks over the system. In this paper, we describe the development of a more eecient prioritized load balancing strategy.
منابع مشابه
An Effective Task Scheduling Framework for Cloud Computing using NSGA-II
Cloud computing is a model for convenient on-demand user’s access to changeable and configurable computing resources such as networks, servers, storage, applications, and services with minimal management of resources and service provider interaction. Task scheduling is regarded as a fundamental issue in cloud computing which aims at distributing the load on the different resources of a distribu...
متن کاملData-Driven Execution of Fast Multipole Methods
Fast multipole methods have O(N) complexity, are compute bound, and require very little synchronization, which makes them a favorable algorithm on next-generation supercomputers. Their most common application is to accelerate N -body problems, but they can also be used to solve boundary integral equations. When the particle distribution is irregular and the tree structure is adaptive, load-bala...
متن کاملLoad Balancing Prioritized Tasks via Work-Stealing
Work-stealing schedulers focus on minimizing overhead in task scheduling. Consequently, they avoid features, such as task priorities, which can add overhead to the implementation. Thus in such schedulers, low priority tasks may be scheduled earlier, delaying the execution of higher priority tasks and possibly increasing overall execution time. In this paper, we develop a decentralized work-stea...
متن کاملDynamic Load Balancing with Group Communication
This work considers the problem of efficiently performing a set of tasks using a network of processors in the setting where the network is subject to dynamic reconfigurations, including partitions and merges. A key challenge for this setting is the implementation of dynamic load balancing that reduces the number of tasks that are performed redundantly because of the reconfigurations. We explore...
متن کاملHow network topology affects dynamic loading balancing
The authors compare the perJbrmances of five dynamic loadbalancing strategies. The simulator they ’ue developed lets them measure these performances across a range of network topologies, including a 20 mesh, a 4 0 hypercube, a linear array, and a composite Fibonacci cube. multiprocessor network without load balancing processes processor-generated tasks locally with little or no sharing of compu...
متن کامل