NoC design and optimization for Multi-core media processors

More documents

Recommendations

Info

CHAPTER 1. INTRODUCTION 3SoCBuS[19], Reconfigurable Circuit Switched NoC[7], etc.1.2.2 Packet SwitchingIn packet switching, the message to be transmitted is partitioned and transmitted asfixed-length packets. Routing and control is handled on a per packet basis. The packetheader includes routing and other control information needed for the packet to reachthe destination. Packet switching increases network resource utilization as communicationchannels share resources along the path. Buffers and arbitration units in routersmanage resource conflicts and storage demands in communication paths. Packet switchingnetworks aid IP block re-use and are scalable[20]. Packet-switching is more flexiblethan circuit switching though it requires buffering and introduces unpredictable latency(jitter). Popular packet switched networks are Asynchronous NoC[21], FAUST[22], ArterisNoC[23], Butterfly Fat Tree[24], DyAD[25], Eclipse[26], MANGO[27], Proteo[28],QNoC[29], SPIN[30], etc. Some NoC designs can adaptively work in circuit or packetswitched modes based on traffic requirements. A few examples are Æthereal[31], HeterogeneousIP Block Interconnection[32], dynamically reconfigurable NoC[33], Octagon[34],etc.1.2.3 Label SwitchingLabel switching is used by technologies such as ATM[35][36] and Multiprotocol LabelSwitching (MPLS)[37] as a packet relaying technique. Individual packets carry route informationin the form of labels. A label denotes a common route that a set of data packetstraverse. Therefore, a minimalistic label identifies the source hop and the destination hopalong with the intermediate transit routers. Along with routing information, labels canbe used to specify service priorities to packets. This feature of labels enables use of differentiatedservices for packets using common labels. Routers along the path use thelabel to identify the next hop, forwarding information, traffic priority, Quality of Serviceguarantees and the next label to be assigned. Label switching inherently supports trafficengineering, as labels can be chosen based on desired next hop or required QoS services.
CHAPTER 1. INTRODUCTION 4A few proposals of label switched NoCs are MPLS NoC[38], Nexus[39] and Blackbus[40].1.3 QoS in NoCsNoCs servicing CMPs and SoCs are expected to meet Quality of Service (QoS) demandsof executing applications. Latency sensitive applications demand a guaranteed averageandmaximumlatencyoncommunicationtraffic. Jittersensitiveapplicationsmaytoleratelonger latencies but require fixed delay along communication paths. Further, in betweenclasses of application some have higher priority than others. For example, applicationdata usually has higher priority than acknowledgment packets or control information.The two basic approaches in NoC designs to enable QoS guarantees are: creation ofreserved connections between source and destinations via circuit switching or support forprioritized routing (in case of packet switched, connectionless paths).Circuit switched NoCs guarantee high data transfer rates in an energy efficient mannerby reducing intra-route data storage[41]. Circuit switched NoCs provide guaranteed QoSfor worst case traffic scenarios leading to higher network resource requirements[42]. Theseare well suited for streaming traffic generated by media processors where communicationrequirements are well known a priori. One of the drawbacks here is under utilizationof network resources as resources are reserved for peak bandwidth while the averagerequirement might be lesser.Packetswitchednetworksprovideefficientinterconnectutilizationandhighthroughputs[43]while providing fairness amongst best effort flows. However, network resources in packetswitched networks need to be over-provisioned to support QoS for various traffic classesand have high buffer requirements in routers. Packet switching networks usually provideQoS by differentiated services to traffic by classifying them into various classes[29]. Prioritizedservices are provided to traffic belonging to each class. Due to the sharing ofnetwork resources, packet switched networks can be configured to provide GuaranteedThroughput (GT) for a few classes of traffic and Best Effort (BE) services for remainingclasses.With traffic engineering enabled label switching networks, communication loads can
Page 1 and 2: NoC Design & Optimization of Multic
Page 3 and 4: Abstractiibit data bus, 4 bit label
Page 5 and 6: Abstractivinterconnect latency.Simu
Page 7 and 8: PublicationsJournals• Basavaraj T
Page 9 and 10: CONTENTSviii2.4 Summary . . . . . .
Page 11 and 12: CONTENTSxC The Flow Algorithm 155C.
Page 13 and 14: LIST OF TABLESxii5.4 Synthesis Para
Page 15 and 16: LIST OF FIGURESxiv3.16 Schematic re
Page 17 and 18: LIST OF FIGURESxviB.3 8×8 mesh use
Page 19: CHAPTER 1. INTRODUCTION 2there is a
Page 23 and 24: CHAPTER 1. INTRODUCTION 6Figure 1.1
Page 25 and 26: CHAPTER 1. INTRODUCTION 8link micro
Page 27 and 28: CHAPTER 1. INTRODUCTION 10identify
Page 29 and 30: CHAPTER 2. RELATED WORK 12this sect
Page 31 and 32: CHAPTER 2. RELATED WORK 14Æthereal
Page 33 and 34: CHAPTER 2. RELATED WORK 16in [64] a
Page 35 and 36: CHAPTER 2. RELATED WORK 18the overa
Page 37 and 38: CHAPTER 2. RELATED WORK 20Intacte[8
Page 39 and 40: CHAPTER 2. RELATED WORK 22predict t
Page 41 and 42: CHAPTER 2. RELATED WORK 24Sapphire[
Page 43 and 44: CHAPTER 2. RELATED WORK 26case, ban
Page 45 and 46: CHAPTER 2. RELATED WORK 28Level-2 c
Page 47 and 48: Chapter 3Link Microarchitecture Exp
Page 49 and 50: CHAPTER 3. LINK MICROARCHITECTURE E
Page 71 and 72:
CHAPTER 3. LINK MICROARCHITECTURE E
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
CHAPTER 4. TILE EXPLORATION 62inclu
Page 81 and 82:
CHAPTER 4. TILE EXPLORATION 64Execu
Page 83 and 84:
CHAPTER 4. TILE EXPLORATION 66reduc
Page 85 and 86:
CHAPTER 4. TILE EXPLORATION 68laten
Page 87 and 88:
CHAPTER 4. TILE EXPLORATION 70local
Page 89 and 90:
CHAPTER 4. TILE EXPLORATION 72each
Page 91 and 92:
CHAPTER 4. TILE EXPLORATION 74Table
Page 93 and 94:
CHAPTER 4. TILE EXPLORATION 76of op
Page 95 and 96:
CHAPTER 4. TILE EXPLORATION 78Table
Page 97 and 98:
CHAPTER 4. TILE EXPLORATION 80FFT.
Page 99 and 100:
CHAPTER 4. TILE EXPLORATION 82Progr
Page 101 and 102:
CHAPTER 4. TILE EXPLORATION 84resul
Page 103 and 104:
Page 105 and 106:
Page 107 and 108:
CHAPTER 4. TILE EXPLORATION 906560F
Page 109 and 110:
CHAPTER 4. TILE EXPLORATION 92Progr
Page 111 and 112:
Page 113 and 114:
CHAPTER 4. TILE EXPLORATION 964.9 I
Page 115 and 116:
CHAPTER 4. TILE EXPLORATION 981.151
Page 117 and 118:
Chapter 5Label Switched NoC - Motiv
Page 119 and 120:
CHAPTER 5. LABEL SWITCHED NOC 102Ta
Page 121 and 122:
CHAPTER 5. LABEL SWITCHED NOC 104co
Page 123 and 124:
CHAPTER 5. LABEL SWITCHED NOC 1065.
Page 125 and 126:
CHAPTER 5. LABEL SWITCHED NOC 108
Page 127 and 128:
CHAPTER 5. LABEL SWITCHED NOC 110IN
Page 129 and 130:
CHAPTER 5. LABEL SWITCHED NOC 1120R
Page 131 and 132:
Page 133 and 134:
Chapter 6LS-NoC ManagementStreaming
Page 135 and 136:
CHAPTER 6. LS-NOC MANAGEMENT 118abi
Page 137 and 138:
CHAPTER 6. LS-NOC MANAGEMENT 120the
Page 139 and 140:
CHAPTER 6. LS-NOC MANAGEMENT 122Tab
Page 141 and 142:
CHAPTER 6. LS-NOC MANAGEMENT 124Vid
Page 143 and 144:
CHAPTER 6. LS-NOC MANAGEMENT 126S0l
Page 145 and 146:
CHAPTER 6. LS-NOC MANAGEMENT 128Flo
Page 147 and 148:
Page 149 and 150:
CHAPTER 7. LABEL SWITCHED NOC 132OR
Page 151 and 152:
CHAPTER 7. LABEL SWITCHED NOC 1347.
Page 153 and 154:
CHAPTER 7. LABEL SWITCHED NOC 136LS
Page 155 and 156:
CHAPTER 7. LABEL SWITCHED NOC 138co
Page 157 and 158:
Chapter 8Conclusion and Future Work
Page 159 and 160:
CHAPTER 8. CONCLUSION AND FUTURE WO
Page 161 and 162:
CHAPTER 8. CONCLUSION AND FUTURE WO
Page 163 and 164:
Appendix AInterface and Outputs of
Page 165 and 166:
APPENDIXA. INTERFACEANDOUTPUTSOFTHE
Page 167 and 168:
Appendix BTesting & Validation of L
Page 169 and 170:
APPENDIX B. TESTING & VALIDATION OF
Page 171 and 172:
APPENDIX B. TESTING & VALIDATION OF
Page 173 and 174:
APPENDIX C. THE FLOW ALGORITHM 156X
Page 175 and 176:
APPENDIX C. THE FLOW ALGORITHM 158E
Page 177 and 178:
Bibliography[1] W.J. Dally and B. T
Page 179 and 180:
BIBLIOGRAPHY 162[16] C. Hilton and
Page 181 and 182:
BIBLIOGRAPHY 164[32] ErnoSalminen,T
Page 183 and 184:
BIBLIOGRAPHY 166[50] Erno Salminen,
Page 185 and 186:
BIBLIOGRAPHY 168[66] N. Megiddo. Op
Page 187 and 188:
BIBLIOGRAPHY 170[84] B.S. Landman a
Page 189 and 190:
BIBLIOGRAPHY 172[101] Michael Huang
Page 191 and 192:
BIBLIOGRAPHY 174[118] J Gonzlez and
Page 193 and 194:
BIBLIOGRAPHY 176[133] Ron Ho, Kenne
show all

NoC design and optimization for Multi-core media processors

Create successful ePaper yourself

Delete template?

Save as template?