• Login
    View Item 
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    •   MINDS@UW Home
    • MINDS@UW Madison
    • College of Letters and Science, University of Wisconsin–Madison
    • Department of Computer Sciences, UW-Madison
    • Math Prog Technical Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Distributed Genetic Algorithms for Partitioning Uniform Grids

    Thumbnail
    File(s)
    Distributed Genetic Algorithms for Partitioning Uniform Grids (484.0Kb)
    Date
    1996
    Author
    Christou, Ioannis T.
    Metadata
    Show full item record
    Abstract
    In this thesis the author presents 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 it is shown that the partition produced by this 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.
    Permanent Link
    http://digital.library.wisc.edu/1793/65713
    Type
    Technical Report
    Citation
    96-09
    Part of
    • Math Prog Technical Reports

    Contact Us | Send Feedback
     

     

    Browse

    All of MINDS@UWCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Login

    Contact Us | Send Feedback