Abstract
Solving the Task Assignment Problem is important for many real time and computational scenarios where many small tasks need to be solved by multiple processors simultaneously. In this paper, a Heuristic and Parallel Algorithm for Task Assignment Problem is proposed. Results obtained for certain cases are presented and compared with the optimal solutions obtained by already available algorithms. It is observed that the proposed algorithm works much faster and efficient than the existing algorithms. The paper also demonstrates how the proposed algorithm could be extended to multiple distributed processors.
An Erratum for this chapter can be found at http://dx.doi.org/10.1007/978-3-319-07350-7_69
An erratum to this chapter can be found at http://dx.doi.org/10.1007/978-3-319-07350-7_69
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shen, C.-C., Tsai, W.-H.: A Graph Matching Approach to Optimal task assignment in Distributed computing systems using a Minimax Criterion. IEEE Transactions on Computers 34(3) (1985)
Cormen, L., Rivest, S.: A star Algorithm. Introduction To Algorithms (2001)
Mohan, R.: A parallel Heuristic Graph Matching Method for Task Assignment, pp. 575–579. IEEE
Chen, W.-H., Lin, C.-S.: A hybrid heuristic to solve a task allocation problem. Comput. Oper. Res. 27(3), 287–303 (2000)
Efe, K.: Heuristic models of task assignment scheduling in distributed systems. IEEE Comput. 15(6), 50–56 (1982)
El-Rewini, H., Lewis, T.G., Ali, H.H.: Task Scheduling in Parallel and Distributed Systems. Prentice-Hall (1994)
Giersch, A., Robert, Y., Vivien, F.: Scheduling tasks sharing les on heterogeneous master-slave platforms. In: 12th Euromicro Workshop on Parallel Distributed and Network-Based Processing (2004)
Hamam, Y., Hindi, K.S.: Assignment of program modules to Processors: A simulated annealing approach. European J. Oper. Res. 122(2), 509–513 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Varma Mudunuru, P., Ramesh, S. (2014). Efficient Parallel Heuristic Graph Matching Approach for Solving Task Assignment Problem in Distributed Processor System. In: Kumar Kundu, M., Mohapatra, D., Konar, A., Chakraborty, A. (eds) Advanced Computing, Networking and Informatics- Volume 2. Smart Innovation, Systems and Technologies, vol 28. Springer, Cham. https://doi.org/10.1007/978-3-319-07350-7_55
Download citation
DOI: https://doi.org/10.1007/978-3-319-07350-7_55
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07349-1
Online ISBN: 978-3-319-07350-7
eBook Packages: EngineeringEngineering (R0)