Random constrained pseudo-Boolean optimization algorithm for multiprocessor systems and clusters

Author

Kazakovtsev, L.

Author_Institution

Dept. of Inf. Technol., Siberian State Aerosp. Univ. (SibSAU), Krasnoyarsk, Russia

fYear

2012

fDate

3-5 Oct. 2012

Firstpage

466

Lastpage

473

Abstract

In this paper, we consider an approach to developing parallel versions of the algorithms based on the modified probability changing method for constrained pseudo-Boolean optimization. Optimization algorithms are adapted for the systems with shared memory (OpenMP) and cluster systems (MPI). The parallel efficiency is estimated for the large-scale non-linear pseudo-Boolean optimization problems with linear constraints and traveling salesman problem.

Keywords

Boolean functions; multiprocessing systems; optimisation; parallel algorithms; pattern clustering; shared memory systems; travelling salesman problems; MPI; OpenMP; linear constraints; modified probability changing method-based algorithms; multiprocessor cluster system; multiprocessor systems; parallel efficiency; parallel versions; random constrained pseudoBoolean optimization algorithm; shared memory; traveling salesman problem; Algorithm design and analysis; Clustering algorithms; Estimation; Linear programming; Optimization; Search problems; Vectors; MPI; discrete optimization; parallel computing;

fLanguage

English

Publisher

ieee

Conference_Titel

Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), 2012 4th International Congress on

Conference_Location

St. Petersburg

ISSN

2157-0221

Print_ISBN

978-1-4673-2016-0

Type

conf

DOI

10.1109/ICUMT.2012.6459711

Filename

6459711