Adaptive Network on Chip Routing Using the Turn Model
Total Page:16
File Type:pdf, Size:1020Kb
University of New Hampshire University of New Hampshire Scholars' Repository Master's Theses and Capstones Student Scholarship Spring 2013 Adaptive Network on Chip Routing using the Turn Model Jonathan W. Brown University of New Hampshire, Durham Follow this and additional works at: https://scholars.unh.edu/thesis Recommended Citation Brown, Jonathan W., "Adaptive Network on Chip Routing using the Turn Model" (2013). Master's Theses and Capstones. 779. https://scholars.unh.edu/thesis/779 This Thesis is brought to you for free and open access by the Student Scholarship at University of New Hampshire Scholars' Repository. It has been accepted for inclusion in Master's Theses and Capstones by an authorized administrator of University of New Hampshire Scholars' Repository. For more information, please contact [email protected]. Adaptive Network on Chip Routing using the Turn Model BY Jonathan W. Brown B.S., University of New Hampshire (2011) THESIS Submitted to the University of New Hampshire in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science May, 2013 UMI Number: 1523783 All rights reserved INFORMATION TO ALL USERS The quality of this reproduction is dependent upon the quality of the copy submitted. In the unlikely event that the author did not send a complete manuscript and there are missing pages, these will be noted. Also, if material had to be removed, a note will indicate the deletion. Di!ss0?t&iori Publishing UMI 1523783 Published by ProQuest LLC 2013. Copyright in the Dissertation held by the Author. Microform Edition © ProQuest LLC. All rights reserved. This work is protected against unauthorized copying under Title 17, United States Code. ProQuest LLC 789 East Eisenhower Parkway P.O. Box 1346 Ann Arbor, Ml 48106-1346 This thesis has been examined and approved. Thesis director, Michel Charpentier Associate Professor of Computer Science Radim Bartos Associate Professor of Computer Science ______________________________ Qiaoyan/Yu Assistant Professor of Electrical and Computer Engineer ing Phil Hatcher Professor of Computer Science H /'y (3 D ate ACKNOWLEDGMENTS It is with immense gratitude that I acknowledge the support and help of my thesis advisers, Professor Michel Charpentier, who always found time to provide constructive feedback to my thoughts and who was patient with my writing style, Professor Radim Bartos, who taught me how to explain my thoughts and present them clearly in writing, Professor Qiaoyan Yu, who answered my detailed oriented questions and helped me progress, and Professor Phil Hatcher who never let any detail slip pass me. I would also like to thank all my friends in W236 who helped me on the days where nothing seemed to be working and gave me the push to approach the problem from a different angle and the Computer Science Department that let me experience the joy of programming. Lastly I would like to thank my parents who always gave me encouragement. TABLE OF CONTENTS ACKNOWLEDGMENTS................................................................................................. iii ABSTRACT ....................................................................................................................... ix Chapter 1 Network on Chip Description and Model 1 1.1 History ...................................................................................................................... 1 1.2 Network on C hip ............................................ 2 1.3 NoC Operation......................................................................................................... 4 1.4 NoC Operation Examples...................................................................................... 5 1.5 Challenges in a N oC................................................................................................ 9 Chapter 2 Routing Algorithms in a 2D Mesh 11 2.1 The Turn Model ......................................................................................... 11 2.2 X Y ............................................................................................................................... 12 2.3 W est-First................................................................................................................... 12 2.4 Negative-First ............................................................................................................. 13 2.5 O dd-E ven................................................................................................................... 14 2.6 Non-Minimal O d d -E v en.......................................................................................... 17 2.7 D y X Y ......................................................................................................................... 22 2.8 Adaptivity of Routing Algorithms ...................................................................... 22 Chapter 3 Weighted Non-Minimal OddEven 25 3.1 Routing C ost............................................................................................................. 25 3.2 Stress V a lu e s ............................................................................................................. 25 3.3 Queue P e n a lty .......................................................................................................... 27 3.4 Direction P en alty...................................................................................................... 27 3.5 Weighted Non-Minimal O d d E v en .......................................................................... 28 iv 3.6 Implementation on a N o C....................................................................................... 30 Chapter 4 Experimental Framework 31 4.1 Experiments................................................................................................................ 31 4.2 Measures ................................................................................................................... 32 4.3 Little’s L a w ................................................................................................................ 37 Chapter 5 Experimental Evaluation 39 5.1 Bit Reverse ................................................................................................................ 39 5.2 T ranspose................................................................................................................... 41 5.3 Uniform R an d o m...................................................................................................... 43 5.4 Complement ................................................................................................................ 45 5.5 H o ts p o t ...................................................................................................................... 47 5.6 WeNMOE and N M O E............................................................................................. 47 Chapter 6 Conclusion 51 v LIST OF TABLES 4-1 Traffic P a tte rn s .................................................................................................... 32 4-2 Little’s Law results .............................................................................................. 37 5-1 Parameter values for WeNMOE ....................................................................... 39 vi LIST OF FIGURES 1-1 Neighbors of a router ........................................................................................... 2 1-2 Model of a NoC router........................................................................................ 3 1-3 Structure of packet .............................................................................................. 4 1-4 Routing taking several cycles to process a head f lit .................................... 7 1-5 Routing taking several cycles to process a head flit with the desired output port already reserved.......................................................................................... 8 2-1 The eight turns in the turn model.................................................................... 11 2-2 Turns for algorithms based on the turn model.............................................. 13 2-3 Valid and invalid turns in Odd-Even.............................................................. 17 2-4 Direction s e t s ........................................................................................................ 18 2-5 Adaptivity of Existing Routing Algorithms ................................................. 24 4-1 Total number of flits in the network for packet injection rate 1% .... 33 4-2 Total number of flits in the network for packet injection rate 2% .... 34 4-3 Average latency for XY in a 9x9 m e s h ........................................................... 35 4-4 Important differences when comparing multiple algorithms......................... 36 5-1 Bit reverse traffic on a 8 x 8 m e s h ..................................................................... 40 5-2 Source and destination pairs for bit reverse traffic on a 4x4 network . 41 5-3 Source and destination pairs for transpose traffic....................................... 41 5-4 Transpose traffic on a 8 x 8 mesh .................................................................... 42 5-5 Transpose traffic on a 9x9 mesh .................................................................... 42 5-6 Example of source and destination pairs for uniform random traffic . 43 5-7 Uniform random traffic on a8 x 8 m e s h ..........................................................