Evolutionary-based conflict-free scheduling of collective communications on spidergon NoCs

The Spidergon interconnection network has become popular recently in multiprocessor systems on chips. To the best of our knowledge, algorithms for collective communications (CC) have not been discussed in the literature as yet, contrary to pair-wise routing algorithms. The paper investigates complexity of CCs in terms of lower bounds on the number of communication steps at conflict-free scheduling. The considered networks on chip make use of wormhole switching, full duplex links and all-port non-combining nodes. A search for conflict-free scheduling of CCs has been done by means of evolutionary algorithms and the resulting numbers of communication steps have been summarized and compared to lower bounds. Time performance of CCs can be evaluated from the obtained number of steps, the given start-up time and link bandwidth. Performance prediction of applications with CCs among computing nodes of the Spidergon network is thus possible.

[1]  Philip K. McKinley,et al.  An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[2]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[3]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[4]  G. De Micheli,et al.  Guest Editors' Introduction: The Network-on-Chip Paradigm in Practice and Research , 2005, IEEE Des. Test Comput..

[5]  Miltos D. Grammatikakis,et al.  Design of Cost-Efficient Interconnect Processing Units , 2008 .

[6]  Nicola Concer,et al.  aEqualized: A novel routing algorithm for the Spidergon Network On Chip , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[7]  Wim Vanderbauwhede,et al.  An Analytical Performance Model for the Spidergon NoC , 2007, 21st International Conference on Advanced Information Networking and Applications (AINA '07).

[8]  Jirí Jaros,et al.  Evolutionary Design of OAB and AAB Communication Schedules for Interconnection Networks , 2006, EvoWorkshops.

[9]  Sujit Dey,et al.  An Interconnect Architecture for Networking Systems on Chips , 2002, IEEE Micro.

[10]  Wim Vanderbauwhede,et al.  A Performance Model of Communication in the Quarc NoC , 2008, 2008 14th IEEE International Conference on Parallel and Distributed Systems.

[11]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Axel Jantsch,et al.  Networks on chip , 2003 .

[14]  Jirí Jaros,et al.  An evolutionary approach to collective communication scheduling , 2007, GECCO '07.

[15]  M. Coppola,et al.  Spidergon: a novel on-chip communication network , 2004, 2004 International Symposium on System-on-Chip, 2004. Proceedings..

[16]  Petr Posík.  Estimation of Distribution Algorithms , 2006 .