Lecture 9 - Åbo Akademi
Lecture 9 - Åbo Akademi Lecture 9 - Åbo Akademi
Switching strategies • Allocating one buffer per physical link • virtual circuits are time multiplexed with a single buffer per link • uses time division multiplexing (TDM) to statically schedule the usage of links among virtual circuits • flits are typically buffered at the NIs and sent into the NoC according to the TDM schedule • global scheduling with TDM makes it easier to achieve end-to-end bandwidth and latency guarantees • less expensive router implementation, with fewer buffers
Switching strategies • Packet Switching • packets are transmitted from source and make their way independently to receiver • possibly along different routes and with different delays • zero start up time, followed by a variable delay due to contention in routers along packet path • QoS guarantees are harder to make in packet switching than in circuit switching • three main packet switching scheme variants • SAF (store-and-forward) switching • packet is sent from one router to the next only if the receiving router has buffer space for entire packet • buffer size in the router is at least equal to the size of a packet • Disadvantage: excessive buffer requirements
- 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 30 and 31: NoC Topology • Most direct networ
- 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 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
- Page 80 and 81: Optical Interconnects: Open Problem
- Page 82 and 83: RF/Wireless Interconnects • Micro
- Page 84 and 85: RF/Wireless Interconnects • Paths
- Page 86 and 87: RF/Wireless Interconnects: Open Pro
- Page 88 and 89: CNT Interconnects • Carbon nanotu
- Page 90 and 91: Multi-Wall Carbon Nanotubes (MWCNT)
Switching strategies<br />
• Packet Switching<br />
• packets are transmitted from source and make their way<br />
independently to receiver<br />
• possibly along different routes and with different delays<br />
• zero start up time, followed by a variable delay due to contention<br />
in routers along packet path<br />
• QoS guarantees are harder to make in packet switching than in<br />
circuit switching<br />
• three main packet switching scheme variants<br />
• SAF (store-and-forward) switching<br />
• packet is sent from one router to the next only if the receiving<br />
router has buffer space for entire packet<br />
• buffer size in the router is at least equal to the size of a packet<br />
• Disadvantage: excessive buffer requirements
Change language