Abstract
In this paper, we describe the Globalizer software system for solving the global optimization problems. The system is designed to maximize the use of computational potential of the modern high-performance computational systems in order to solve the most time-consuming optimization problems. The highly parallel computations are facilitated using various distinctive computational schemes: processing several optimization iterations simultaneously, reducing multidimensional optimization problems using multiple Peano space-filling curves, and multi-stage computing based on the nested block reduction schemes. These novelties provide for the use of the supercomputer system capabilities with shared and distributed memory and with large numbers of processors to solve the global optimization problems efficiently.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
