Lecture 9 - Åbo Akademi
Lecture 9 - Åbo Akademi Lecture 9 - Åbo Akademi
NoC Topology • Most direct network topologies have an orthogonal implementation, where nodes can be arranged in an n-dimensional orthogonal space • routing for such networks is fairly simple • e.g. n-dimensional mesh, torus, folded torus, hypercube, and octagon • 2D mesh is most popular topology • all links have the same length • eases physical design • area grows linearly with the number of nodes • must be designed in such a way as to avoid traffic accumulating in the center of the mesh
NoC Topology • Torus topology, also called a k-ary n-cube, is an n- dimensional grid with k nodes in each dimension • k-ary 1-cube (1-D torus) is essentially a ring network with k nodes • limited scalability as performance decreases when more nodes • k-ary 2-cube (i.e., 2-D torus) topology is similar to a regular mesh • except that nodes at the edges are connected to switches at the opposite edge via wraparound channels • long end-around connections can, however, lead to excessive delays
- Page 1 and 2: Special Course in Computer Science:
- Page 3 and 4: Network-on-Chip (NoC) Why NoC OCP S
- Page 5 and 6: From simpler to more complex chips
- Page 7 and 8: Problems to solve • Cores that pe
- Page 9 and 10: Some driving forces • Technical I
- Page 11: NoC illustration
- Page 14 and 15: OCP standard for on-chip communicat
- Page 16 and 17: OCP Characteristics • IP Core •
- Page 18 and 19: Flexibility of OCP • Several usef
- Page 20 and 21: Some fundamental OCP concepts: Addr
- Page 22 and 23: Some fundamental OCP concepts: In-b
- Page 24 and 25: Some fundamental OCP concepts: Side
- Page 26 and 27: Introduction • Network-on-chip (N
- Page 28 and 29: Introduction • ISO/OSI network pr
- Page 32 and 33: NoC Topology • Folding torus topo
- Page 34 and 35: NoC Topology • Indirect Topologie
- Page 36 and 37: NoC Topology • (m, n, r) symmetri
- Page 38 and 39: NoC Topology • Irregular or ad ho
- Page 40 and 41: Switching strategies • Two main m
- Page 42 and 43: Switching strategies • Allocating
- Page 44 and 45: Switching strategies • VCT (virtu
- Page 46 and 47: Routing algorithms • Static and d
- Page 48 and 49: Routing algorithms • Minimal and
- Page 50 and 51: Routing algorithms • Routing algo
- Page 52 and 53: ACK/NACK flow control scheme • wh
- Page 54 and 55: Clocking schemes • Fully synchron
- Page 56 and 57: NoC Architectures examples
- Page 58 and 59: HERMES • Developed at the Faculda
- Page 60 and 61: Nostrum • Developed at KTH in Sto
- Page 62 and 63: QNoC • Developed at Technion in I
- Page 64 and 65: SPIN • Scalable programmable inte
- Page 66 and 67: Emerging NoC paradigms Overall goal
- Page 68 and 69: Novel Interconnect Paradigms for Mu
- Page 70 and 71: Motivation • Increasingly harder
- Page 72 and 73: Emerging Alternatives • Optical I
- Page 74 and 75: Optical Interconnects • Board-to-
- Page 76 and 77: Optical Interconnects • Waveguide
- Page 78 and 79: Optical Interconnects • OIs have
NoC Topology<br />
• Torus topology, also called a k-ary n-cube, is an n-<br />
dimensional grid with k nodes in each dimension<br />
• k-ary 1-cube (1-D torus) is essentially a ring network with k nodes<br />
• limited scalability as performance decreases when more nodes<br />
• k-ary 2-cube (i.e., 2-D torus) topology is<br />
similar to a regular mesh<br />
• except that nodes at the edges are connected<br />
to switches at the opposite edge via wraparound<br />
channels<br />
• long end-around connections can, however,<br />
lead to excessive delays
Change language