A scalable cellular implementation of parallel genetic programming
نویسندگان
چکیده
منابع مشابه
A scalable cellular implementation of parallel genetic programming
A new parallel implementation of genetic programming based on the cellular model is presented and compared with both canonical genetic programming and the island model approach. The method adopts a load balancing policy that avoids the unequal utilization of the processors. Experimental results on benchmark problems of different complexity show the superiority of the cellular approach with resp...
متن کاملautomatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولSpeeding up Genetic Programming: A Parallel BSP implementation
A parallel implementation of Genetic Programming is described, using the Bulk Synchronous Parallel Programming (BSP) model, as implemented by the Oxford BSP library. It is shown that considerable speedup of the GP execution can be achieved. As the complexity and the size of the problem increases, the actual speedup can be improved (assuming a constant number of processors), since the communicat...
متن کاملComparison Between Synchronous and Asynchronous Implementation of Parallel Genetic Programming
An evolutionary method such as Genetic Programming (GP) can be used to solve a large number of complex problems in various application domains. However, one obvious shortcoming of GP is that it usually uses a substantial amount of processing time to arrive at a solution. In this paper, we present the parallel implementations that can reduce the processing time by using a coarse-grained model fo...
متن کاملOptimising Parallel Logic Programming Systems for Scalable Machines Optimising Parallel Logic Programming Systems for Scalable Machines
Logic programs are good examples of symbolic applications that often exhibit large amounts of implicit parallelism and that can greatly beneet from parallel computers. Parallel logic programming (PLP) systems have obtained excellent results for traditional bus-based shared-memory architectures. However, the scalable multiprocessors being developed today pose new challenges, such as the high lat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2003
ISSN: 1089-778X
DOI: 10.1109/tevc.2002.806168