A "New" Networking Topology: Fixed Fanout Generalized Fat Trees
Submitted by rothpc on Tue, 2012-03-20 15:57
Dr. Timothy Dysart
Colloq: Speaker Institution:
Colloq: Date and Time:
Wed, 2010-10-06 10:00
5100, Room 128 JICS Lecture Hall
Dr. Jeffrey Vetter
Colloq: Host Email:
This talk will introduce a new topology, the fixed fanout generalizedfat tree, for connecting large numbers of nodes. The original contextfor this topology is a large scale memory system where each node isidentical and contains memory, processing, and routing capabilities.Since each node is identical, this topology varies from traditionalfat tree related topologies where some nodes are dedicated toprocessing/memory and other nodes are dedicated to routing. Becauseof this difference in node architecture, we have developed new messagerouting algorithms and analyzed the performance of severalcommunication types for a range of node fanout values and treeheights. While we have yet to fully compare this topology to otherapproaches (ongoing work) three major items have stood out: 1) tens tothousands of potential organizations can exist for nodes with a givenfanout and a specific tree height, 2) broadcast messages to tens ofthousands of nodes can be completed by traversing only a handful oflinks, and 3) specific organizations may have large amounts ofintrinsic fault tolerance.
Colloq: Speaker Bio:
Tim Dysart is currently a post-doctoral research associate in ComputerScience and Engineering (CSE) at the University of Notre Dame. Hisdissertation research was on defect and fault tolerance innanoelectronic devices and architectures. He is broadly interested incomputing systems and architectures, particularly in the areas of howto utilize new technologies and ensuring reliable computation. Tim isa triple Domer having earned his B.S. (Comp. Eng, 2002), M.S. (CSE,2005), and Ph.D. (CSE, 2009) all from the University of Notre Dame.