Abstract
Traditionally, the assignment problem between tasks and processors is worked out by scheduling methods. In this paper, we have an innovative idea to construct a problem-solving environment for computational grids. To bridge the gap between the parallel processing technology and the heterogeneous computing environment, the grid computing resources are reorganized architecturally to form a virtual regular topology. In this research, we put emphasis on finding a heuristic algorithm of transferring an irregular grid resource topology into a mesh virtually.
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.
Similar content being viewed by others
References
Chen, J., Taylor, V.E.: Mesh partitioning for efficient use of distributed systems. IEEE Transactions on Parallel and Distributed Systems 13(1), 67–79 (2002)
Coffman, E.G., Garey, M.R., Johnson, D.S.: Approximation algorithms for bin packing: a survey. Approximation Algorithms for NP-hard Problems, 46–93 (1997)
Foster, I., Kesselman, C. (eds.): The Grid: Blueprint for a New Computing Infrastructure, 1st edn. Morgan-Kaufman, San Francisco (1998)
Huang, S., Aubanel, E., Bhavsar, V.C.: Pagrid: A mesh partitioner for computational grids. Journal of Grid Computing 4(1), 71–88 (2006)
Leung, J.Y.T., Tam, T.W., Wong, C.S.: Packing squares into a square. Journal of Parallel and Distributed Computing 10, 271–275 (1990)
Modi, J.J.: Parallel Algorithms and Matrix Computation. Clarendon Press (1988)
Pearl, J.: Heuristics: intelligent search strategies for computer problem solving. Addison-Wesley Longman Publishing Co., Inc., Boston (1984)
Pellegrini, F., Roman, J.: Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs. In: Liddell, H., Colbrook, A., Hertzberger, B., Sloot, P.M.A. (eds.) HPCN-Europe 1996. LNCS, vol. 1067, pp. 493–498. Springer, Heidelberg (1996)
Schloegel, K., Karypis, G., Kumar, V.: Graph Partitioning for High-Performance Scientific Simulations. In: Sourcebook of Parallel Computing, pp. 491–541. Morgan Kaufmann, San Francisco (2003)
Walshaw, C., Cross, M.: Multilevel mesh partitioning for heterogeneous communication networks. Future Generation Computer Systems 17(5), 601–623 (2001)
Yao, A.C.C.: New algorithms for bin packing. Journal of the ACM 27(2), 207–227 (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, UR., Wu, CC., Li, SW., Lin, W. (2009). Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods. In: Ślęzak, D., Kim, Th., Yau, S.S., Gervasi, O., Kang, BH. (eds) Grid and Distributed Computing. GDC 2009. Communications in Computer and Information Science, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10549-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-10549-4_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10548-7
Online ISBN: 978-3-642-10549-4
eBook Packages: Computer ScienceComputer Science (R0)