01628nab a2200253 i 4500 acta12635 20220614100515.0 161015s1999 hu o 0|| eng d 0324-721X SZTE Egyetemi Kiadványok Repozitórium hun eng Ortigosa Pilar M. A parallelized sequential random search global optimization algorithm [elektronikus dokumentum] / Ortigosa Pilar M. 1999 403-418 Acta cybernetica 14 No. 2 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. Természettudományok Számítás- és információtudomány Számítástechnika, Kibernetika, Algoritmus Balogh János aut García Inmaculada aut Conference for PhD Students in Computer Science (1.) (1998) (Szeged) http://acta.bibl.u-szeged.hu/12635/1/cybernetica_014_numb_002_403-418.pdf Dokumentum-elérés