Lecture 9 - Åbo Akademi
Lecture 9 - Åbo Akademi Lecture 9 - Åbo Akademi
QNoC • Developed at Technion in Israel • Direct network with an irregular mesh topology • WH switching with an XY minimal routing scheme • Link-to-link credit-based flow control • Traffic is divided into four different service classes • signaling, real-time, read/write, and block-transfer • signaling has highest priority and block transfers lowest priority • every service level has its own small buffer (few flits) at switch input • Packet forwarding is interleaved according to QoS rules • high priority packets able to preempt low priority packets • Hard guarantees not possible due to absence of circuit switching • Instead statistical guarantees are provided
SOCBUS • Developed at Linköping University • Mesochronous clocking with signal retiming is used • Circuit switched, direct network with 2-D mesh topology • Minimum path length routing scheme is used • Circuit switched scheme is • deadlock free • requires simple routing hardware • very little buffering (only for the request phase) • results in low latency • Hard guarantees are difficult to give because it takes a long time to set up a connection
- 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 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 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)
- Page 94 and 95: Conceptual transmitter and receiver
- Page 98 and 99: 3D and NoCs • 3D stacking technol
QNoC<br />
• Developed at Technion in Israel<br />
• Direct network with an irregular mesh topology<br />
• WH switching with an XY minimal routing scheme<br />
• Link-to-link credit-based flow control<br />
• Traffic is divided into four different service classes<br />
• signaling, real-time, read/write, and block-transfer<br />
• signaling has highest priority and block transfers lowest priority<br />
• every service level has its own small buffer (few flits) at switch input<br />
• Packet forwarding is interleaved according to QoS rules<br />
• high priority packets able to preempt low priority packets<br />
• Hard guarantees not possible due to absence of circuit<br />
switching<br />
• Instead statistical guarantees are provided
Change language