Skip to main content
SpringerLink
Log in

Optimisation of irregular multiprocessor computer architectures using geneticalgorithms

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Many problems today need the computing power that is only available by using large‐scaleparallel processing. For a significant number of these problems, the density of theglobal communications between the individual processors dominates the performance ofthe whole parallel implementation on a distributed memory multiprocessor system. In thesecases, the design of the interconnection network for the processors is known to play asignificant part in the efficient implementation of real problems. Important criteria to optimisethe efficiency of a configuration are the maximum and average distance a message hasto travel between processors. Minimum path systems are irregular multiprocessor computerarchitectures which optimise these criteria. These architectures provide an efficient alternativeto the more common regular topologies for solving real applications in parallel. Thispaper presents new results for two combinatorial problems that occur during the generationof these optimal irregular configurations. These are:

(1) The design of the optimum interconnection network between the processors for configurationscontaining up to 128 processors.

(2) The design of the routing tables to provide the optimal routing of messages withinthese irregular networks.

The paper shows how these combinatorial problems have been solved, using genetic algorithmsfor the first problem and a random local search procedure for the second. It alsoincludes a comparison with the results obtained for regular topologies, for example: hypercubes,tori, and rings.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R.W. Ashford, P. Connard and R. Daniel, Experiments in solving mixed integer programming problems on a small array of transputers, Journal of the Operations Research Society 43(1992) 519-531.

    Google Scholar 

  2. T. Back and H. Schwefel, An overview of evolutionary algorithms for parameter optimization, Evolutionary Computation 1(1993)1-23.

    Google Scholar 

  3. N. Biggs, Algebraic Graph Theory, Cambridge Tracts in Math. No. 67, Cambridge University Press, London, 1974.

    Google Scholar 

  4. B. Bollobas, Extremal Graph Theory, Academic Press, London, 1978.

    Google Scholar 

  5. C.J. Burgess and A.G. Chalmers, Optimum configurations for multiprocessor systems, Research Report CSTR-94-18, Department of Computer Science, University of Bristol, Dec. 1994.

  6. C.J. Burgess and A.G. Chalmers, Optimum transputer configurations for real applications requiring global communications, in: 18th World Occam and Transputer Users Group Conference, IOS Press, 1995.

  7. C.J. Burgess, A genetic algorithm for the optimisation of a multiprocessor computer architecture, GALESIA'95, in: 1st IEE/IEEE International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, IEE Conference Publication No. 414, 1995, pp. 39-44.

  8. A.G. Chalmers, S. Fiddes and D.J. Paddon, Parallel panel methods, in: 13th Occam Users Group Conference, IOS Press, York, 1990, pp. 313-321

    Google Scholar 

  9. A.G. Chalmers and S. Gregory, Constructing minimum path configurations for multiprocessor systems, Parallel Computing 19(1993)343-355.

    Google Scholar 

  10. A.G. Chalmers and J.P. Tidmus, Practical Parallel Processing: An Introduction to Problem Solving in Parallel, International Thomson Computer Press, 1996.

  11. C. Von Conta, Torus and other networks as communication networks with up to some hundred points, IEEE Transactions on Computers 33(1983)657-666.

    Google Scholar 

  12. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.

  13. D.E. Goldberg, Genetic Algorithms in Search, Optimisation, and Machine Learning, Addison-Wesley, 1989.

  14. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, 1975.

  15. P. Sharpe, A.G. Chalmers and A. Greenwood, Genetic algorithms for generating minimum path configurations, Microprocessors and Microsystems 19(1995)9-14.

    Google Scholar 

  16. T. Warwick and E.P.K. Tsang, Using a genetic algorithm to tackle the processor configuration problem, Computer Science Technical Report No. CSM-190, University of Essex, 1993.

Download references

Authors
  1. C.J. Burgess
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A.G. Chalmers
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burgess, C., Chalmers, A. Optimisation of irregular multiprocessor computer architectures using geneticalgorithms. Annals of Operations Research 86, 239–257 (1999). https://doi.org/10.1023/A:1018906802621

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018906802621

Keywords

Search

Navigation