Add to ORKGThe paper presents an approach to improve the efficiency of some two-level optimization algorithms by their implementation in parallel MIMD multiprocessor systems. Diagonal decomposition dynamic programming and parametric optimization methods are considered, and some concepts of their parallelization are discussed. Results regarding the implementation of computations in a parallel multitransputer system are presented. For the analysed problems, the obtained values of speedup are close to the theoretical maximum values
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
Global optimization problems arise in a wide range of real-world problems. They include applications...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
The paper presents an analysis of the use of optimization algorithms in parallel solutions and distr...
The faster processing power of modern computers and the development of efficient algorithms have mad...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
Abstract: The paper considers a development of approach to construction of parallel algori...
Introduces the developments in the construction, analysis, and implementation of parallel computing ...
This paper addresses computationally intensive global optimization problems, for solving of which th...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
In this paper we consider the design of optimization algorithms to run efficiently on highly paralle...
In this article the model of the multiprocessing system which allows to significantly speed up the i...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
Global optimization problems arise in a wide range of real-world problems. They include applications...
This paper presents a straightforward approach to determining how best to utilize an MIMD multiproce...
The paper presents an analysis of the use of optimization algorithms in parallel solutions and distr...
The faster processing power of modern computers and the development of efficient algorithms have mad...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
The present paper discusses real parallel computations. On the basis of a selected group of dynamic ...
Abstract: The paper considers a development of approach to construction of parallel algori...
Introduces the developments in the construction, analysis, and implementation of parallel computing ...
This paper addresses computationally intensive global optimization problems, for solving of which th...
Problems in combinatorial optimization, whether they are solved exactly or approximately by a heuris...
In this paper we consider the design of optimization algorithms to run efficiently on highly paralle...
In this article the model of the multiprocessing system which allows to significantly speed up the i...
Two issues in linear algebra algorithms for multicomputers are addressed. First, how tounify paralle...
The problem of finding a global minimum of a real function on a set S Rn occurs in many real world p...
The work presented in this thesis is mainly involved in the design and analysis of asynchronous para...
Global optimization problems arise in a wide range of real-world problems. They include applications...