By Topic

A genetic algorithm for the optimisation of a multiprocessor computer architecture

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
C. J. Burgess ; Bristol Univ., UK

Many computer problems today need the computer power that is only available using large scale parallel processing. For a significant number of these problems, the density of the global communications between the individual processors dominates the performance of the whole parallel implementation on a distributed memory multiprocessor system. In these cases, the design of the interconnection network for the processors is known to play a significant part in the efficient implementation of real problems. Networks of processors connected as an irregular configuration have the advantage that they satisfy best known criteria for producing configurations that perform well on real applications. This paper presents a new genetic algorithm for the generation of optimal irregular configuration, which is a challenging problem since there is no obvious representation which allows all the main genetic operations to be implemented effectively

Published in:

Genetic Algorithms in Engineering Systems: Innovations and Applications, 1995. GALESIA. First International Conference on (Conf. Publ. No. 414)

Date of Conference:

12-14 Sep 1995