Abstract
Task assignment is one of the most challenging problems in distributed computing environment. An optimal task assignment guarantees minimum turnaround time for a given architecture. Using heuristic graph matching, it is often impossible to get optimal task assignment for practical test cases within an acceptable time limit. In this paper, the basic heuristic graph-matching algorithm of task assignment is parallelized which is suitable only for cases where processors and inter processor links are homogeneous. This proposal is a derivative of the basic task assignment methodology using heuristic graph matching. The results show that near optimal assignments (greater than ninety percentage) are obtained much faster than the sequential program with reasonable speed-up.Keywordstask assignmentload balancinggraph partitionheuristic graph matchingsymmetrical multi-processors
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
