An improved firefly algorithm for permutation routing in baseline multistage interconnection network

This paper present the parallelization of firefly algorithm for permutation routing in baseline multistage interconnection network. The proposed parallel firefly algorithm employs a self routing approach to route the permutation in baseline network. The objective of this paper is as follows (i) to improve serial firefly algorithm to parallel one for better utilization of multi core/ many core processor. (ii) to use speedup, quality of solution and efficiency as performance metric in improved firefly algorithm for optimal permutation routing in baseline network. (iii) the analysis of the simulation results on firefly algorithm is compared with other algorithms. Simulation results demonstrate that the proposed parallel firefly algorithm for permutation routing in baseline network outperforms known sequential and parallel algorithm in terms of speedup, efficiency and quality solution.