A Dynamic Load Balancing Algorithm for eterogeneous Computing Environment
Piyush Maheshwari · 1996
Heterogeneous computing opens up new challenges and opportunities in fields such as parallel processing, design of algorithms for applications, partitioning and mapping of parallel tasks, interconnection network tech-nology and the design of heterogeneous programming environments. Lots of load balancing algorithms have been proposed and experimented with in the past years for homogeneous parallel and distributed systems. We present a priority-based decay usage load balancing algorithm for a heterogeneous computing environment. The algorithm determines the task precedence graph of the parallel jobs dynamically at run-time and assigns appropriate priorities to the processes to resolve the dependencies. The heuristic algorithm has been tested on some heterogeneous program models. 1.