Ortigosa Pilar M. and Balogh János and García Inmaculada: A parallelized sequential random search global optimization algorithm. In: Acta cybernetica, (14) 2. pp. 403-418. (1999)
Preview |
Cikk, tanulmány, mű
cybernetica_014_numb_002_403-418.pdf Download (1MB) | Preview |
Abstract
This work deals with a stochastic global optimization algorithm, called CRS (Controlled Random Search), which originally was devised as a sequential algorithm. Our work is intended to analyze the degree of parallelism that can be introduced into CRS and to propose a new refined parallel CRS algorithm (RPCRS). As a first stage, evaluations of RPCR S were carried out by simulating parallel implementations. The degree of parallelism of RPCR S is controlled by a user given parameter whose value must be tuned to the size of the parallel computer system. It will be shown that the greater the degree of parallelism is the better the performance of the sequential and parallel executions are.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Acta cybernetica |
| Date: | 1999 |
| Volume: | 14 |
| Number: | 2 |
| ISSN: | 0324-721X |
| Page Range: | pp. 403-418 |
| Language: | English |
| Place of Publication: | Szeged |
| Event Title: | Conference for PhD Students in Computer Science (1.) (1998) (Szeged) |
| Related URLs: | http://acta.bibl.u-szeged.hu/38508/ |
| Uncontrolled Keywords: | Számítástechnika, Kibernetika, Algoritmus |
| Additional Information: | Bibliogr.: p. 417-418. ; összefoglalás angol nyelven |
| Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
| Date Deposited: | 2016. Oct. 15. 12:26 |
| Last Modified: | 2022. Jun. 14. 10:05 |
| URI: | http://acta.bibl.u-szeged.hu/id/eprint/12635 |
Actions (login required)
 |
View Item |
