Skip to main content

Evolutionary Design of Group Communication Schedules for Interconnection Networks

  • Conference paper
Computer and Information Sciences - ISCIS 2005 (ISCIS 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3733))

Included in the following conference series:

Abstract

As chip multiprocessors are quickly penetrating new application areas in network and media processing, their interconnection architectures become a subject of optimization. Group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with a processor count. This paper deals with the design of a new application-specific Bayesian Optimization Algorithm (BOA) and the use of BOA and HSGA (Hybrid parallel Genetic Simulated Annealing) to design optimal communication algorithms for an arbitrary topology of the interconnection network. Each of these algorithms is targeted for a different switching technique. The group communication schedules were designed for an asymmetrical AMP network on one hand and for the benchmark hypercube network on the other, using SF (Store-and-Forward) and WH (Wormhole) switching.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jantsch, A., Tenhunen, H.: Networks on Chip. Kluwer Academic Publ., Boston (2003) ISBN 1-4020-7392-5

    Google Scholar 

  2. www.sgi.com

  3. Larrañaga, P., Lozano, J.A.: Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  4. Ocenasek, J.: Parallel Estimation of Distribution Algorithms. PhD. Thesis, Faculty of Information Technology, Brno University of Technology, Brno, Czech Rep. (2002)

    Google Scholar 

  5. Duato, J., Yalamanchili, S.: Interconnection Networks – An Engineering Approach. Morgan Kaufman Publishers, Elsevier Science (2003)

    Google Scholar 

  6. Staroba, J.: Parallel Performance Modelling, Prediction and Tuning. PhD. Thesis, Faculty of Information Technology, Brno University of Technology, Brno, Czech Rep. (2004)

    Google Scholar 

  7. Ohlídal, M., Schwarz, J.: Hybrid parallel simulated annealing using genetic operations, Brno (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jaroš, J., Ohlídal, M., Dvořák, V. (2005). Evolutionary Design of Group Communication Schedules for Interconnection Networks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569596_50

Download citation

  • DOI: https://doi.org/10.1007/11569596_50

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29414-6

  • Online ISBN: 978-3-540-32085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics