Publication detail

Design of Group Communication for Regular and Irregular Networks

OHLÍDAL, M. SCHWARZ, J.

Original Title

Design of Group Communication for Regular and Irregular Networks

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

Communication between non-adjacent processors in regular and irregular interconnection networks mostly relies on routing tables. Because the tables generally cannot be derived by means of an analytical approach, we have focused on the utilization of the hybrid parallel genetic simulated annealing algorithm HGSA [1] to design optimal or sub-optimal routing schedule for a sequence of communication steps (neighbor-to-neighbor transfers) during the group communications. The efficiency of the HGSA algorithm was tested on the regular hypercube topology (with the known complexity of communication) and on the irregular AMP (A Minimum Path) topology.

Keywords

group communications, hybrid parallel genetic simulated annealing, communication architectures, parallel processing

Authors

OHLÍDAL, M.; SCHWARZ, J.

RIV year

2005

Released

15. 6. 2005

Publisher

Faculty of Mechanical Engineering BUT

Location

Brno

ISBN

80-214-2961-5

Book

Mendel 2005 11th Internacional Conference on Soft Computing

Pages from

45

Pages to

50

Pages count

6

URL

BibTex

@inproceedings{BUT21518,
  author="Miloš {Ohlídal} and Josef {Schwarz}",
  title="Design of Group Communication for Regular and Irregular Networks",
  booktitle="Mendel 2005 11th Internacional Conference on Soft Computing",
  year="2005",
  pages="45--50",
  publisher="Faculty of Mechanical Engineering BUT",
  address="Brno",
  isbn="80-214-2961-5",
  url="https://www.fit.vut.cz/research/publication/7815/"
}

Documents