NoC design and optimization for Multi-core media processors

More documents

Recommendations

Info

CHAPTER 2. RELATED WORK 13switches interconnects 12 IPs supports both bursty (for image traffic) and non-bursty (forcontrol and synchronization signals) traffic. Network resources in this NoC are tailoredto meet throughput and bandwidth demands of the application and hence the design isnot a generic solution for servicing QoS in an CMP environment.2.1.2 QoS in Circuit Switched NetworksResource reservation between communicating nodes involves identification of path usingpoint-to-point links or a path probing service network or an intelligent, traffic awaredistributed or centralized manager. Hu et. al.[15] introduce point-to-point (P2P) communicationsynthesistomeettimingdemandsbetweencommunicatingnodesusingbuswidthsynthesis. Circuit switched bus based QoS solutions such as Crossroad[13], dTDMA[14]and Heterogeneous IP Block Interconnection (HIBI)[32] rely on communication localizationto satisfy timing demands. NEXUS[39] is a resource reservation based QoS NoCfor globally asynchronous, locally synchronous (GALS) architectures. NEXUS uses anasynchronous crossbar to connect synchronous modules through asynchronous channelsand clock-domain converters.P2P networks do not share communication links between multiple nodes leading toinefficient utilization of network resources. This increases wiring resources inside thechip and results in poor scalability. Crossbar based solutions using protocol handshakes(for example, 4-way handshakes in NEXUS[39] and ProtoNoC[17]) force communicatingnodes to wait till handshake is complete and path is established. Non-interference ofcommunication channels is achieved by over-provisioning resources in the crossbar. Thisleads to complex and poorly scalable networks. Connecting frequently communicatingnodes on a single bus will increase demand on the bus and lead to larger waiting times atthe nodes. Static routing along shortest paths does not guarantee latency bound routesdue to arbitration delays in the network.Amongst the NoCs that use a probe based circuit establishment solutions are Intel’s8×8 circuit switched NoC[41], SoCBUS[19][55] and distributed programming model in
CHAPTER 2. RELATED WORK 14Æthereal[51]. In these NoCs, probe packets are used to reconnoiter shortest communicationpaths and configure routing tables if path (circuit) is available. Routers are lockeddown and no other circuits can use the port during the lifetime of an established circuit.If the shortest X-Y path is not available, the probe packets initiate route discovery mechanismsin other paths. The method involves some dynamic behaviour as the probe mightrepeat route discovery steps or try after a random period of time if circuit set up doesnot succeed. This leads to indeterministic and sometimes large route setup times whichmay be unacceptable for real time application performance.Centralized Circuit ManagementReserved communication channels can be identified and configured using an applicationawarehardwareorsoftwareentity[51][34]. Suchatrafficmanagercanprovideprogrammabilityof routes.The Æthereal NoC [51] aims at providing hard guaranteed QoS using Time DivisionMultiplexing(TDM) to avoid contention in a synchronous network. The centralizedprogramming model in Æthereal NoC[51] uses a root process to identify free slots andconfigure network interfaces. Time slot tables are used in routers to reserve output portsper input port in a particular time slot. To avoid collisions and the loss of data, consecutivetime slots are then reserved in routers along the circuit path. The number ofpaths established in the NoC is restricted by the scheduling constraints during time slotsreservation. Increasing the number of time slots in TDM based NoCs increases router size.In cases where a communication channel cannot be found due to slots exhaustion, thetraffic division over multiple physical paths may be required[56]. Traffic division involvesreordering packets at the target node leading to increased memory and computationalcosts.TDM techniques using slot tables in Æthereal[51] and sequencers in Adaptive Systemon-Chip[12]require a single synchronous clock distributed over the chip. Accurate globalsynchronousclockdistributionisexpensiveintermsofpower. Globalsynchronicitycanbeachieved in a distributed manner using tokens such that every router synchronizes every
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 and 20: CHAPTER 1. INTRODUCTION 2there is a
Page 21 and 22: CHAPTER 1. INTRODUCTION 4A few prop
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: CHAPTER 2. RELATED WORK 12this sect
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 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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?