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.
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
Gao, H., Schmidt, A., Gupta, A., Luksch, P.: Load balancing for Spatial-Grid-Based Parallel Nu- meric Simulation on Clusters of SMPs. In: Proceeding of the Euromicro PDP 2003 Conference, Genoa, Italy, February 5-7, pp. 75–82. IEEE Computer Society Publications, Los Alamitos (2003)
Gao, H., Schmidt, A., Gupta, A., Luksch, P.: A Graph-matching based Intra-node Load balancing Methodology for clusters of SMPs. In: Proceedings of the 7th World Multiconference on Systems, Cubernetics and Informatics (SCI 2003) (July 2003)
Shen, C.-c., Tsai, W.-H.: A Graph Matching Approach to Optimal task as- signment in Distributed computing systems using a Minimax Criterion. IEEE Transactions on Computers C-34(3) (March 1985)
Kernighan, B.W., Lin, S.: An efficient Heuristic procedure for partitioning graphs. Bell Systems Tech, J. 49, 291–308 (1970)
Kernighan, B.W., Lin, S.: An efficient Heuristic procedure for partitioning graphs. Bell Systems Tech, J. 49, 291–308 (1970)
Bui, T.N., Chaudhuri, S., Leighton, F.T., Sipser, M.: Graph Bisection Algorithms with good aver- age case behavior. Combinatorica 7, 171–191 (1987)
Williams, R.D.: Performance of Dynamic load balancing algorithms for unstructured mesh calculations. Concurrency: Practice and Experience 3, 457–481 (1991)
Farhat, C.: A simple and efficient automatic FEM domain decomposer. Computers and Structures 28, 579–602 (1988)
Fiduccia, C.M., Mattheyses, R.M.: A liner-time heuristic for improve network partitions. In: ACM IEEE Nineteenth Design Automation Conference Proceedings, vol. 1982, ch.126, pp. 175–181 (1982)
Sadayappan, P., Ercal, F., Ramanujam, J.: Cluster Partitioning approach to mapping parallel program onto a hypercube. Parallel Computing 13, 1–16 (1990)
Barnard, S.T., Simon, H.D.: A parallel implementation of multilevel recursive spectral bisection for application to adaptive unstructured meshes. In: Bailey, D.H., Bjorstad, P.E., Gilbert, Jr., Mascagni, M.V., Schreiber, R.S., Simon, H.D., Torczon, V.J., Watson, J.T. (eds.). SIAM Proceedings Series, vol. 195, pp. 627–632. SIAM, Philadelphia (1995)
Barnard, S.T.: PMRSB: parallel multilevel recursive spectral bisection (1996) (manuscript)
Karypis, G., Kumar, V.: Parallel Multilevel k-way Partitioning Scheme for Irregular Graphs, Technical Report TR 96-036, Department of Computer Science, University of Minnesota (1996)
Nilsson, N.J.: Artificial intelligence: a new synthesis (March 1998) ISBN: 1-55860-467-7
Boman, E.G., Catalyurec, U.V., Chevalier, C.: Advances in Parallel Partitioning, Load Balancing and Matrix ordering for Scientific Computing. Journal of Physics: Conference Series, JPCS (2009)
Dehne, F., Yogaratnam, K.: Exploring the Limits of GPUs with Parallel Graph Algorithms. Cornell University Library, Ithica (February 24, 2010)
Zaslavskiy, M., Bach, F., Vert, J.-P.: Many-to-Many Graph Matching: A Continuous Relaxation Approach. In: Balcázar, J.L., Bonchi, F., Gionis, A., Sebag, M. (eds.) ECML PKDD 2010. LNCS, vol. 6323, pp. 515–530. Springer, Heidelberg (2010), doi:10.1007/978-3-642-15939-8_33
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mohan, R., Gupta, A. (2011). A Parallel Task Assignment Using Heuristic Graph Matching. In: Nagamalai, D., Renault, E., Dhanuskodi, M. (eds) Advances in Parallel Distributed Computing. PDCTA 2011. Communications in Computer and Information Science, vol 203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24037-9_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-24037-9_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24036-2
Online ISBN: 978-3-642-24037-9
eBook Packages: Computer ScienceComputer Science (R0)