Advertisement

Quality-of-Service in BiNoc

  • Sao-Jie Chen
  • Ying-Cherng Lan
  • Wen-Chung Tsai
  • Yu-Hen Hu
Chapter

Abstract

A QoS-aware BiNoC architecture is proposed in this chapter to support guarantee-service (GS) traffic while reducing packet delivery latency. With the dynamically self-reconfigured bidirectional communication channels incorporated in BiNoC, as presented in  Chap. 6, our proposed QoS-aware technique can promise more flexibility for various traffic flow patterns. Specifically, a novel inter-router communication protocol is proposed to prioritize bandwidth arbitration in favor of high-priority GS traffic flows. Multiple virtual-channels with prioritized routing policy are also implemented to facilitate data transmission with QoS considerations. Combining these architectural innovations, the QoS-aware BiNoC architecture can promise reduced latency of packet delivery and a more efficient channel resource utilization.

Keywords

Traffic Flow Idle State Channel Direction Good Effort Guarantee Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    W. J. Dally and B. Towles, Principles and Practices of Interconnection Networks, Morgan Kaufmann, 2004Google Scholar
  2. 2.
    R. Guerin and V. Peris, “Quality-of-Service in Packet Networks: Basic Mechanisms and Directions,” in Proceedings of the Computer Networks, pp. 169-179, February 1999Google Scholar
  3. 3.
    M. D. Harmanci, N. P. Escudero, Y. Leblebici, and P. Ienne, “Quantitative Modeling and Comparison of Communication Schemes to Guarantee Quality-of-Service in Networks-on-Chip,” in Proceedings of the International Symposium on Circuits and Systems, pp. 1782- 1785, May 2005Google Scholar
  4. 4.
    E. Rijpkema, K. G. W. Goossens, A. Radulescu, J. Dielissen, J. V. Meerbergen, P. Wielage, and E. Waterlander, “Trade-offs in the Design of a Router with Both Guaranteed and Best-Effort Services for Networks-on-Chip,” in Proceedings of the Design Automation and Test in Europe Conference, pp. 350-355, March 2003Google Scholar
  5. 5.
    G. M. Chiu, “The Odd-Even Turn Model for Adaptive Routing,” IEEE Transactions on Parallel and Distributed Systems, vol. 11, no. 7, pp. 729-738, July 2000Google Scholar
  6. 6.
    J. Hu and R. Marculescu, “DyAD–Smart Routing for Networks-on-Chip,” in Proceedings of the Design Automation Conference, pp. 260-263, June 2004Google Scholar
  7. 7.
    M. Li, Q.A. Zeng, and W. B. Jone, “DyXY - a Proximity Congestion-Aware Deadlock-Free Dynamic Routing Method for Network on Chip,” in Proceedings of the Design Automation Conference, pp.849-852, July 2006Google Scholar
  8. 8.
    D. C. Gazis, Traffic Science, John Wiley and Sons, 1974Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Sao-Jie Chen
    • 1
  • Ying-Cherng Lan
    • 1
  • Wen-Chung Tsai
    • 1
  • Yu-Hen Hu
    • 2
  1. 1.National Taiwan UniversityTaipeiTaiwan R.O.C
  2. 2.University of Wisconsin-MadisonMadisonUSA

Personalised recommendations