Open Access. Powered by Scholars. Published by Universities.®

OS and Networks Commons

Open Access. Powered by Scholars. Published by Universities.®

2004

Discipline
Institution
Keyword
Publication
Publication Type

Articles 31 - 32 of 32

Full-Text Articles in OS and Networks

Optimal Design Of Engineering Systems Using Mpi-Enabled Genetic Algorithm, S. D. Rajan, D. T. Nguyen, M. D. Deshpande, L. Harrell Jan 2004

Optimal Design Of Engineering Systems Using Mpi-Enabled Genetic Algorithm, S. D. Rajan, D. T. Nguyen, M. D. Deshpande, L. Harrell

Civil & Environmental Engineering Faculty Publications

The focus of this paper is on the development and implementation of a genetic algorithm (GA)-based software system using message passing interface (MPI) protocol and library. A customized form of simple GA used in previous research [1-4] is parallelized. This MPI-enabled version is used to find the solution to finite element based design optimization problems. Results show that an almost linear speedup is obtained on homogenous hardware cluster and, with proper reworking of the software, on heterogeneous hardware cluster.


Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan Jan 2004

Qos Routing Optimization Strategy Using Genetic Algorithm In Optical Fiber Communication Networks, Zhaoxia Wang, Zengqiang Chen, Zhuzhi Yuan

Research Collection School Of Computing and Information Systems

This paper describes the routing problems in optical fiber networks, defines five constraints, induces and simplifies the evaluation function and fitness function, and proposes a routing approach based on the genetic algorithm, which includes an operator [OMO] to solve the QoS routing problem in optical fiber communication networks. The simulation results show that the proposed routing method by using this optimal maintain operator genetic algorithm (OMOGA) is superior to the common genetic algorithms (CGA). It not only is robust and efficient but also converges quickly and can be carried out simply, that makes it better than other complicated GA.