کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
433061 689225 2012 10 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Making-a-stop: A new bufferless routing algorithm for on-chip network
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
Making-a-stop: A new bufferless routing algorithm for on-chip network
چکیده انگلیسی

In the deep submicron regime, the power and area consumed by router buffers in network-on-chip (NoC) have become a primary concern. With buffers elimination, bufferless routing is emerging as a promising solution to provide power-and-area efficiency for NoC. In this paper, we present a new bufferless routing algorithm that can be coupled with any topology. The proposed routing algorithm is based on the concept of making-a-stop (MaS), aiming to deadlock and livelock freedom in wormhole-switched NoC. Performance evaluation is carried out by using a flit-level, cycle-accurate network simulator under synthetic traffic scenarios. Simulation results indicate that the proposed routing algorithm yields an improvement over the recent bufferless routing algorithm in average latency, power consumption, and area overhead by up to 10%, 9%, and 80%, respectively.


► We propose a new power-and-area efficient routing algorithm for on-chip networks.
► We reduce design complexity and the need of large buffering requirements at receiver side.
► We prove the deadlock- and livelock-free freedom of the proposed algorithm.
► We carry out performance evaluation under synthetic traffic scenarios.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Parallel and Distributed Computing - Volume 72, Issue 4, April 2012, Pages 515–524
نویسندگان
, , ,