Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often show good optimization behavior but are...
Ant Colony Optimization (ACO) is a metaheuristic used to solve combinatorial optimization problems. As with other metaheuristics, like evolutionary methods, ACO algorithms often show good optimization behavior but are slow when compared to classical heuristics. Hence, there is a need to find fast implementations for ACO algorithms. In order to allow a fast parallel implementation, we propose several changes to a standard form of ACO algorithms. The main new features are the non-generational approach and the use of a threshold based decision function for the ants. We show that the new algorithm has a good optimization behavior and also allows a fast implementation on reconfigurable processor arrays. This is the first implementation of the ACO approach on a reconfigurable architecture. The running time of the algorithm is quasi-linear in the problem size n and the number of ants on a reconfigurable mesh with n 2 processors, each provided with only a constant number of memory words.
One of the key issues in designing new simulation models for parallel execution, or in the migration of existing models to parallel platforms, is the mapping of the application architecture to the parallel system arch...
详细信息
Genericity of parallel programming environments, enabling development of portable parallel programs, is expected to result in performance penalties. Furthermore, programmability and tool support of programming environ...
Genericity of parallel programming environments, enabling development of portable parallel programs, is expected to result in performance penalties. Furthermore, programmability and tool support of programming environments are important issues if a choice between programming environments has to be made. In this paper we propose a methodology to compare native and generic parallel programming environments, taking into account such competing issues as portability and performance. As a case study, this paper compares the Iserver-Occam, Parix, Express and PVM parallel programming environments on a 512-node Parasytec GCel. Furthermore, we apply our methodology to compare Parix and PVM on a new architecture, a 32-node Parsytec PowerXplorer, which is based on the PowerPC chip. In our approach we start with a representative application and isolate the basic (environment)-dependent building blocks. These basic building blocks, which depend on floating-point performance and communication capabilities of the environments, are analysed independently. We have measured point-to-point communication times, global communication times and floating-point performance. All information is combined into a time complexity analysis, allowing comparison of the environments on different degrees of functionality. Together with demands for portability of the code and development time (i.e. programmability), an overall judgement of the environments is given.
We compare the Iserver-Occam, Parix, PVM, and Express parallel programming environments on a Parsytec GCel with 512 T805 transputers. The comparison will be made by a detailed analysis of the performance of one partic...
详细信息
The coupled-dipole method is widely used to calculate the light-scattering matrix S from arbitrary particles. An important parameter in the model is the size of the dipolar subunits. Usually a size of approximately 1/...
详细信息
The coupled-dipole method is widely used to calculate the light-scattering matrix S from arbitrary particles. An important parameter in the model is the size of the dipolar subunits. Usually a size of approximately 1/10 to approximately 1/20 of the wavelength of the incident light is sufficient for accurate calculations. However, it was noted that accurate S-34 calculations require much smaller dipolar subunits. We show that this conclusion is too pessimistic, by examining the sensitivity of the S-34 elements on surface roughness of spherical particles. Furthermore we give an example of an accurate S-34 calculation with dipolar subunits as large as 1/10 of the wavelength.
This book constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* ...
详细信息
ISBN:
(数字)9783642291784
ISBN:
(纸本)9783642291777
This book constitutes the refereed proceedings of the International Conference on the Applications of Evolutionary Computation, EvoApplications 2012, held in Málaga, Spain, in April 2012, colocated with the Evo* 2012 events EuroGP, EvoCOP, EvoBIO, and EvoMUSART. The 54 revised full papers presented were carefully reviewed and selected from 90 submissions. EvoApplications 2012 consisted of the following 11 tracks: EvoCOMNET (nature-inspired techniques for telecommunication networks and other parrallel and distributed systems), Evocomplex (algorithms and complexsystems), EvoFIN (evolutionary and natural computation in finance and economics), EvoGAMES (bio-inspired algorithms in games), EvoHOT (bio-inspired heuristics for design automation), EvoIASP (evolutionary computation in image analysis and signal processing), EvoNUM (bio-inspired algorithms for continuous parameter optimization), EvoPAR (parallel implementation of evolutionary algorithms), EvoRISK (computational intelligence for risk management, security and defense applications), EvoSTIM (nature-inspired techniques in scheduling, planning, and timetabling), and EvoSTOC (evolutionary algorithms in stochastic and dynamic environments).
暂无评论