AN EFFICIENT ROUTING ALGORITHM FOR THREE-DIMENSIONAL NETWORKS ON-CHIP WITH PARTIALLY VERTICAL LINKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

VAHDAT PANAH F.; PATOOGHY A.

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR Year:2017 | Volume:15 | Issue:3 Page(s): 211-222

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

1,799

Download:

Cites:

Information Journal Paper

Title

AN EFFICIENT ROUTING ALGORITHM FOR THREE-DIMENSIONAL NETWORKS ON-CHIP WITH PARTIALLY VERTICAL LINKS

Author(s)

VAHDAT PANAH F. | PATOOGHY A. | Issue Writer Certificate

Keywords

DEADLOCKQ1

3D NOCQ2

PARTIALLY CONNECTED TSVSQ1

VIRTUAL CHANNELQ1

Abstract

Three-Dimensional Chips are made of stacking silicon layers which communicate with each other by Through-Silicon-Via (TSV) links. Manufacturing cost of Three-Dimensional chips is a function of the number of TSVs because the fabricating of a three-dimensional chip with fully vertical links is of high cost and high fabrication complexity.The packet routing strategies in the 3D NOCs with partially TSVs is more complex than that in the 2D NoCs. In this paper, we proposed a routing algorithm for the 3D NOCs with partial TSVs, which provides a dynamic routing with maximum adaptivity for packets by dividing the network into three groups of layers, rows and columns. This algorithm is independent of vertical channel's position but related to layer number of the current packet and based on the layer number, odd or even, uses a special turn strategy to route packets on rows and columns with odd or even numbers. The proposed routing algorithm mitigates DEADLOCK and livelock with only two virtual. The experiments show that average packet latency in proposed algorithm is 32.8% smaller than that in Elevator_First which is a well-known algorithm for packet routing in 3D chips. Also, this improvement on average packet latency and network throughput will be more with increasing on network size and reduction on TSV number.

Cites

No record.

References

No record.

Cite

APA: Copy

VAHDAT PANAH, F., & PATOOGHY, A.. (2017). AN EFFICIENT ROUTING ALGORITHM FOR THREE-DIMENSIONAL NETWORKS ON-CHIP WITH PARTIALLY VERTICAL LINKS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, 15(3), 211-222. SID. https://sid.ir/paper/228369/en

Vancouver: Copy

VAHDAT PANAH F., PATOOGHY A.. AN EFFICIENT ROUTING ALGORITHM FOR THREE-DIMENSIONAL NETWORKS ON-CHIP WITH PARTIALLY VERTICAL LINKS. NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR[Internet]. 2017;15(3):211-222. Available from: https://sid.ir/paper/228369/en

IEEE: Copy

F. VAHDAT PANAH, and A. PATOOGHY, “AN EFFICIENT ROUTING ALGORITHM FOR THREE-DIMENSIONAL NETWORKS ON-CHIP WITH PARTIALLY VERTICAL LINKS,” NASHRIYYAH -I MUHANDISI -I BARQ VA MUHANDISI -I KAMPYUTAR -I IRAN, B- MUHANDISI -I KAMPYUTAR, vol. 15, no. 3, pp. 211–222, 2017, [Online]. Available: https://sid.ir/paper/228369/en

Related Journal Papers