ボサール アントワーヌ 研究室

理学部/情報科学科

Interconnection networks of massively parallel systems

ボサール アントワーヌ 研究室

A 3-ary 2D torus-connected cycles network (TCC): 4-cycles are connected according to a 3-ary 2D toru

A graph is made of nodes and edges. Graphs can be used to model many different situations. For instance, modern supercomputers are made of hundreds of thousands computing nodes: they are massively parallel systems. These nodes are connected according to the interconnection network of the system: nodes are processors and edges are links between them. Routing problems in this context are critical issues as they condition data communication efficiency and reliability. What would be the point of having numerous processors if they are not able to communicate with each other efficiently?

Photos

  • A 3-ary 2D torus-connected cycles network (TCC): 4-cycles are connected according to a 3-ary 2D torus

    A 3-ary 2D torus-connected cycles network (TCC): 4-cycles are connected according to a 3-ary 2D torus

Antoine Bossard

ボサール アントワーヌ 准教授

[理学部/情報科学科]

専門分野
  • interconnection networks
  • routing problems
関連リンク

PROFESSOR's VOICE

Big data possibly leading to unsuspected discoveries!

Since the amount of data involved may be huge (“big data”), efficient information processing is essential, but then possibly leading to unsuspected discoveries!

ボサール アントワーヌ准教授

SHARE

ページTOPへ