POLYMORPHIC ON-CHIP NETWORKS
Martha Mercaldi Kim, John D. Davis*, Mark Oskin, Todd Austin** University of Washington *Microsoft Research, Silicon Valley ** University of Michigan
POLYMORPHIC ON-CHIP NETWORKS Martha Mercaldi Kim, John D. Davis*, - - PowerPoint PPT Presentation
POLYMORPHIC ON-CHIP NETWORKS Martha Mercaldi Kim, John D. Davis*, Mark Oskin, Todd Austin** University of Washington *Microsoft Research, Silicon Valley ** University of Michigan On-Chip Network Selection 2 Talk Outline Network-on-chip
Martha Mercaldi Kim, John D. Davis*, Mark Oskin, Todd Austin** University of Washington *Microsoft Research, Silicon Valley ** University of Michigan
2
3
4
16 nodes 64 nodes 256 nodes 1024 nodes
4
mesh ring fat-tree butterfly flattened- butterfly
4
4
store-and-forward wormhole
4
32 bits 64 bits 128 bits
4
4 entries 16 entries 64 entries
4
4
cycle-level software simulator
5
6
(Random Permutation)
6
throughput-sensitive application
(Random Permutation)
6
throughput-sensitive application latency-sensitive application
(Random Permutation)
7
(Random Permutation) (Uniform Random) (Nearest Neighbor)
8
9
9
9
mesh
9
mesh
9
mesh
9
ring mesh
9
ring mesh fat tree
What it is
common
structures
How it is used
switches
10
11
12
12
configurable topology
12
configurable topology configurable resource allocation
13
13
13
13
14
14
14
14
14
14
14
14
15
16
17
18
18
18
18
18
18
19
20
queue width and depth resources per cluster
routing wires
routing resources
21
22
22
Area as ASIC
22
Area as ASIC Area in Polymorphic Fabric
22
Area as ASIC Area in Polymorphic Fabric Area Overhead =
22
Area as ASIC Area in Polymorphic Fabric Area Overhead =
22
Area as ASIC Area in Polymorphic Fabric Area Overhead =
23
144 polymorphic fabrics Area efficient networks have small queues and generous routing resources
24
25
26
2
27
2
28
29
30