A joint project of the Graduate School, Peabody College, and the Jean & Alexander Heard Library

Title page for ETD etd-07072013-145648


Type of Document Master's Thesis
Author Qian, Jianshu
Author's Email Address jianshu.qian@vanderbilt.edu
URN etd-07072013-145648
Title Improved bufferless routing via balanced pipeline stages
Degree Master of Science
Department Electrical Engineering
Advisory Committee
Advisor Name Title
William H. Robinson Committee Member
Yuan Xue Committee Member
Keywords
  • On-chip networks
  • FPGA
  • Multi-core
  • Bufferless routing
Date of Defense 2013-07-01
Availability unrestricted
Abstract
Network-on-chip (NoC) architectures with emerging interconnect technologies have been developed to meet the demand for high-performance computational systems while maintaining energy efficiency. The introduction of deflection routing and bufferless router architectures offers smaller area and lower power consumption for on-chip networks that connect cache to multicore processors. The design of the deflection-routing algorithm is the key for maintaining the performance of the network. This paper presents an investigation of the hardware implementation for a bufferless router. We determine the critical path to maximize the work done per stage for a pipelined architecture. Our design improves the deflection rate when compared to previous literature. We also improve the design based upon the physical implementation by balancing the delay through the pipeline stages. Our design was prototyped using a field-programmable gate array (FPGA) to construct a mesh topology to evaluate the performance. The average latency for flits is reduced by up to 16.2% versus a baseline design.
Files
  Filename       Size       Approximate Download Time (Hours:Minutes:Seconds) 
 
 28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access 
  Master_Thesis_Jianshu_Qian.pdf 684.81 Kb 00:03:10 00:01:37 00:01:25 00:00:42 00:00:03

Browse All Available ETDs by ( Author | Department )

If you have more questions or technical problems, please Contact LITS.