Evolutionary design of OAB and AAB communication schedules for networking systems on chips

被引:0
作者
Jaros, Jiri [1 ]
Dvorak, Vaclav [1 ]
机构
[1] Brno Univ Technol, Fac Informat Technol, Bozetechova 2, CZ-61266 Brno, Czech Republic
来源
PROCEEDINGS OF THE 2006 IEEE WORKSHOP ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS | 2006年
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
One-to-All Broadcast (OAB) and All-to-All Broadcast (AAB) [5] group communications are frequently used in many parallel algorithms and if their overhead is excessive, performance degrades rapidly with processor count. This paper deals with the design of a new application specific Bayesian Optimization Algorithm (BOA) and Standard Genetic Algorithm (SGA) that both produce almost optimal communication schedules for an arbitrary multiprocessor topology. We demonstrated the optimization process on hypercube and AMP topology [1] using Wormhole (WH) switching.
引用
收藏
页码:222 / +
页数:2
相关论文
共 6 条
  • [1] [Anonymous], THESIS BRNO U TECHNO
  • [2] CHALMERS A, 1996, PRACTICAL PARALLEL P
  • [3] DEFAGO X, 2003, DSC2000036
  • [4] Goldberg D., 1989, GENETICS ALGORITHMS
  • [5] JAROS J, 2005, P 20 INT S COMP INF, P472
  • [6] Larra├a┬▒aga P., 2002, ESTIMATION DISTRIBUT