Parallel heuristic graph matching algorithm for task assignment problem in distributed computing systems

@article{Mohan2012ParallelHG,
  title={Parallel heuristic graph matching algorithm for task assignment problem in distributed computing systems},
  author={Raj Mohan and N. P. Gopalan and S. H. Dinesh Prasanth and Siddhant Sanyam and Shubham Varma},
  journal={2012 International Conference on Computer & Information Science (ICCIS)},
  year={2012},
  volume={2},
  pages={575-579}
}
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. Several approaches of optimal task assignment have been proposed by various researchers ranging from graph partitioning based tools to heuristic graph matching. Using heuristic graph matching, it is often impossible to get optimal task assignment for practical test cases within an acceptable time limit. Some… CONTINUE READING