PPT-Destination-Based Adaptive Routing for 2D Mesh

Networks ANCS 2010 Rohit Sunkam Ramanujam Bill Lin Electrical and Computer Engineering University of California San Diego Networks onChip Chipmultiprocessors CMPs increasingly popular. Ran Manevich, Israel Cidon, Avinoam Kolodny, . Isask. ’. har. (Zigi) Walter and Shmuel Wimer. Technion. . –. Israel Institute of Technology. Group. Research. QNoC. Global traffic information is essential to make the right decision!. Rohit Sunkam Ramanujam. Bill Lin. Electrical and Computer Engineering. University of California, San Diego. 2. Networks. -on-Chip. Chip-multiprocessors (. CMPs. ) increasingly popular. 2D-mesh networks often used as on-chip fabric. for . Big-Data Applications . Running on Data Center Networks. * . Mellanox . Technologies . LTD, . +. Technion - EE Department. Eitan Zahavi. *+. Isaac Keslassy. +. . Avinoam Kolodny. +. ANCS 2012. for Disruption Tolerant Networks. Hideya Ochiai Hiroshi Esaki. The University of Tokyo / NICT. DTNRG, IETF 76 Hiroshima, 2009-11-13. Outline. Introduction. Potential-based entropy adaptive routing. Reading Assignment. Sections . 4.1-4.5. Alternative: relevant papers. . References provided. Overview. Separate the routing decisions from implementation. Choice of path vs. . Performance. E.g., buffering, route computation implementation. -Poulin - 4073219. CEG 4136 – Computer Architecture III. November 16. th. , 2010. Questions/Topics. Describe several algorithms used for adaptive . routing.. Describe . problems and advantages of these routing . Read the TexPoint manual before you delete this box.: . A. A. A. A. A. Application of the Week: Games / Art. Uncountable possibilities, below, e.g., a beer coaster that can interact with other coasters…. F. an Li, Yu Wang. IEEE Vehicular Technology Magazine, June 2007. Speaker: . Le . Wang. . Outline. 1. Motivation and overview . 2. . Routing Protocols. Ad Hoc Routing. Position-Based Routing. Cluster-Based Routing. Abdelhamid. MELLOUK, Said HOCEINI, . Farid. BAGUENINE, Mustapha . CHEURFA. Computers and . Communications. , 2008. ISCC 2008. IEEE Symposium . on. Presented By : . Bijay. Kumar . Pathak. 11/30/2012. Routing Distance Vector (DV) Routing Sets up minimum distance routes to all nodes in a network Routing tables created at each node with following fields: The core algorithm is based on ‘ Bellman Ford shortest path algorithm Dynamic Wireless Communication between Peer-to-Peer UAVs Simon Khan AFRL Information Directorate Integrity  Service  Excellence Objectives Today’s collection of Tactical Power and Ground Routing 1 Power Planning New technologies: Great power budget Dense power grids Reasons: Power supply scales more slowly than Moore’s law  Current supplied to chip increase Market demands for functionality Here in mesh network nodes are arranged as a q-dimensional lattice. The neighboring nodes are only allowed to communicate the data in one step i.e., each . PEi. is allowed to send the data to any one of PE(i+1) , PE (i-1), . Prof. Maria Papadopouli. University of Crete. ICS-FORTH. http://www.ics.forth.gr/mobile. Wireless Networks & Mobile Computing. ACKNOWLEDGEMENT. : . Slides used from . presentations by. Manolis. .