Design of Group Communication for Regular and Irregular Networks.pdfVIP

Design of Group Communication for Regular and Irregular Networks Miloš Ohlídal(1) Josef Schwarz(2) (1), (2)Brno University of Technology, Faculty of Information Technology Department of Computer Systems, Božetěchova 2, 612 66 Brno, CZ Tel.: +420-5 fax: +420-5 e-mail: {ohlidal, schwarz}@fit.vutbr.cz 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 analyt ical 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, paral lel processing 1. Introduction Processors in common distributed-memory parallel computers are often interconnected with networks that are node-symmetric, i.e. each node has the same number of channels of the network. Such regular networks like ring, 2D-torus or hyper-cube take advantage of the same relatively simple routing schedule identical for all nodes. All-to-all communications require so that all nodes communicate simultaneously without conflict, i.e. no communication channel between nodes can be used at any time i