Skip to main content
SpringerLink
Log in

Fast distributed genetic algorithms for partitioning uniform grids

  • Conference paper
  • First Online:
Parallel Algorithms for Irregularly Structured Problems (IRREGULAR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1117))

Abstract

In this paper we present a new method for partitioning general large uniform 5-point grids into sub-domains of given areas having minimum total perimeter. For applications in scientific computing in parallel environments, this problem corresponds to minimizing the communication overhead between processors while observing load balancing constraints dictated by the speed of each individual processor. For a large class of grid shapes we show that the partition produced by our method is asymptotically optimal as the problem parameters grow to infinity. A new distributed Genetic Algorithm based on this decomposition theory significantly outperforms other well-known methods such as the spectral bisection (or quadrisection) methods and the geometric mesh partitioner.

This research was partially supported by the Air Force Office of Scientific Research under grant F49620-94-1-0036, and by the NSF under grants CDA-9024618 and CCR-9306807.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. T. Christou and R. R. Meyer. Optimal and asymptotically optimal equipartition of rectangular domains via stripe decomposition. In H. Fischer, B. Riedmuller, and S. Schaffler, editors, Applied Mathematics and Parallel Computing — Festschrift for Klaus Ritter, pages 77–96. Physica-Verlag, 1996.

    Google Scholar 

  2. I. T. Christou and R. R. Meyer. Optimal equi-partition of rectangular domains for parallel computation. Journal of Global Optimization, 8:15–34, January 1996.

    Article  Google Scholar 

  3. P. Crandall and M. Quinn. Non-uniform 2-d grid partitioning for heterogeneous parallel architectures. In Proceedings of the 9th International Symposium on Parallel Processing, pages 428–435, 1995.

    Google Scholar 

  4. A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam. PVM 3 User's Guide and Reference Manual. Oak Ridge National Laboratory, 1994.

    Google Scholar 

  5. J. R. Gilbert, G. L. Miller, and S. H. Teng. Geometric mesh partitioning: Implementation and experiments. In Proceedings of the 9th International Symposium on Parallel Processing, pages 418–427, 1995.

    Google Scholar 

  6. B. Hendrickson and R. Leland. The Chaco User's Guide Version 2.0. Sandia National Laboratories, July 1995.

    Google Scholar 

  7. B. Hendrickson and R. Leland. An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. on Sci. Comput., 16:452–469, 1995.

    Article  Google Scholar 

  8. John Holland. Adaptation in Natural and Artificial Systems. MIT Press, 1992.

    Google Scholar 

  9. B. W. Kernighan and S. Lin. An effective heuristic procedure for partitioning graphs. Bell Systems Tech. Journal, pages 291–308, February 1970.

    Google Scholar 

  10. M. Laguna, T. A. Feo, and H. C. Elrod. A greedy randomized adaptive search procedure for the two — partition problem. Operations Research, July–August 1994.

    Google Scholar 

  11. W. Martin. Fast equi-partitioning of rectangular domains using stripe decomposition. Technical Report MP-TR-96-2, University of Wisconsin-Madison, February 1996.

    Google Scholar 

  12. M. Bousquet Melou. Codage des polyominos convexes et equation pour l'enumeration suivant l'aire. Discrete Applied Mathematics, 48:21–43, 1994.

    Article  Google Scholar 

  13. Zbigniew Michalewicz. Genetic Algorithms + Data Structures=Evolution Programs. Springer-Verlag, 1994.

    Google Scholar 

  14. G. L. Miller, S. H. Teng, W. Thurston, and S. A. Vavasis. Automatic mesh partitioning. In A. George, J. R. Gilbert, and J. W. H. Liu, editors, Graph Theory and Sparse Matrix Computation. Springer-Verlag, 1993.

    Google Scholar 

  15. P. M. Pardalos, F. Rendl, and H. Wolkowicz. The quadratic assignment problem: A survey and recent developments. In P. M. Pardalos and H. Wolkowicz, editors, Quadratic Assignment and Related Problems. American Mathematical Society, 1993.

    Google Scholar 

  16. A. Pothen, H. D. Simon, and K. P. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal on Matrix Analysis and Applications, 11:430–452, 1990.

    Article  Google Scholar 

  17. G. von Laszewski. Intelligent structural operators for the k-way graph partitioning problem. In R. Belew and L. Booker, editors, Proceedings of the Fourth Intl. Conference on Genetic Algorithms, pages 45–52. Morgan Kaufmann Publishers, Los Altos, CA, 1991.

    Google Scholar 

  18. J. Yackel. Minimum Perimeter Tiling in Parallel Computation. PhD thesis, University of Wisconsin-Madison, August 1993.

    Google Scholar 

  19. J. Yackel and R. R. Meyer. Optimal tilings for parallel database design. In P. M. Pardalos, editor, Advances in Optimization and Parallel Computing, pages 293–309. North-Holland, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Sciences Department, University of Wisconsin, 53706, Madison, Wisconsin

    Ioannis T. Christou & Robert R. Meyer

Authors
  1. Ioannis T. Christou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Robert R. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alfonso Ferreira José Rolim Yousef Saad Tao Yang

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Christou, I.T., Meyer, R.R. (1996). Fast distributed genetic algorithms for partitioning uniform grids. In: Ferreira, A., Rolim, J., Saad, Y., Yang, T. (eds) Parallel Algorithms for Irregularly Structured Problems. IRREGULAR 1996. Lecture Notes in Computer Science, vol 1117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030100

Download citation

  • DOI: https://doi.org/10.1007/BFb0030100

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61549-1

  • Online ISBN: 978-3-540-68808-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation