Load balanced allocation of multiple tasks in a distributed computing system

Authors:
Biplab Kumer Sarker;Anil Kumar Tripathi;Deo Prakash Vidyarthi;Laurence Tianruo Yang;Kuniaki Uehara
Affiliations:
Faculty of Computer Science, University of New Brunswick, Fredericton, Canada;Institute of Technology, Banaras Hindu University, Varanasi, India;Jawaharal Nehru University, New Delhi, India;Department of Computer Science, St. Francis Xavier University, Canada;Graduate School of Science and Technology, Kobe University, Japan
Venue:
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Year:
2005

Citing 6
Cited 1

Distributed operating systems

Distributed operating systems
Optimal Task Assignment in Heterogeneous Distributed Computing Systems

IEEE Concurrency
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
A Task Allocation Model for Distributed Computing Systems

IEEE Transactions on Computers
A Graph Matching Approach to Optimal Task Assignment in Distributed Computing Systems Using a Minimax Criterion

IEEE Transactions on Computers
On the Mapping Problem

IEEE Transactions on Computers

Multiple tasks allocation in arbitrarily connected distributed computing systems using a* algorithm and genetic algorithm

ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Distributed Computing Systems (DCS) calls for proper partitioning of tasks into modules and allocating them to various nodes so as to enable parallel execution of their modules by individual different processors of the system. A number of algorithms have been proposed for allocation of tasks in a Distributed Computing System. Most of the models proposed in literature consider modules of a single task for static allocation, for the purpose of allocation onto a DCS. Moreover, they did not consider the architectural capability of the processing nodes and the way of connectivity among them. This work considers allocation of disjoint multiple tasks with their corresponding modules and proposes a parallel algorithm for a realistic situation wherein multiple disjoint tasks with their modules compete for execution on an arbitrarily connected DCS based on well-known A* technique. The proposed algorithm also considers a load balanced allocation for the purpose. The paper justifies the effectiveness of the algorithm with the experimental results by comparing with previously reported works.