Highly adaptive and congestion-aware routing for 3D NoCs
Highly adaptive and congestion-aware routing for 3D NoCs
In this paper, we propose a novel highly adaptive and congestion aware routing algorithm 3D meshes which is equally applicable to 2D meshes as well. The proposed algorithm allows cyclic dependencies in channel dependency graph (CDG) providing higher degree of adaptiveness. The algorithm uses congestion-aware channel selection strategy that results balanced distribution of traffic flows across the network. A packet follows non-minimal paths only when minimal paths are congested at the neighboring channels. The deadlock avoidance methodology adopted by our algorithm remains cost-efficient as it uses one extra virtual channel along each of Y and Z dimensions to achieve deadlock freedom.
978-1-4503-2816-6
97-98
Kumar, Manoj
9c2173aa-5e5a-42d4-981e-522ed30c9248
Laxmi, Vijay
e79a9a3a-cd6b-45d6-8a03-9a5891453a95
Gaur, Manoj
88512231-c396-4b6a-8d73-1a41cfb0e399
Daneshtalab, Masoud
600c11e6-1508-4487-be7d-b290272beb60
Ko, Seok-Bum
dddb4075-84d7-4d88-8463-60d0924b501a
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
21 May 2014
Kumar, Manoj
9c2173aa-5e5a-42d4-981e-522ed30c9248
Laxmi, Vijay
e79a9a3a-cd6b-45d6-8a03-9a5891453a95
Gaur, Manoj
88512231-c396-4b6a-8d73-1a41cfb0e399
Daneshtalab, Masoud
600c11e6-1508-4487-be7d-b290272beb60
Ko, Seok-Bum
dddb4075-84d7-4d88-8463-60d0924b501a
Zwolinski, Mark
adfcb8e7-877f-4bd7-9b55-7553b6cb3ea0
Kumar, Manoj, Laxmi, Vijay, Gaur, Manoj, Daneshtalab, Masoud, Ko, Seok-Bum and Zwolinski, Mark
(2014)
Highly adaptive and congestion-aware routing for 3D NoCs.
Proceedings of the 24th edition of the Great Lakes Symposium on VLSI (GLSVLSI '14), Houston, United States.
21 - 23 May 2014.
.
(doi:10.1145/2591513.2591581).
Record type:
Conference or Workshop Item
(Poster)
Abstract
In this paper, we propose a novel highly adaptive and congestion aware routing algorithm 3D meshes which is equally applicable to 2D meshes as well. The proposed algorithm allows cyclic dependencies in channel dependency graph (CDG) providing higher degree of adaptiveness. The algorithm uses congestion-aware channel selection strategy that results balanced distribution of traffic flows across the network. A packet follows non-minimal paths only when minimal paths are congested at the neighboring channels. The deadlock avoidance methodology adopted by our algorithm remains cost-efficient as it uses one extra virtual channel along each of Y and Z dimensions to achieve deadlock freedom.
This record has no associated files available for download.
More information
Published date: 21 May 2014
Venue - Dates:
Proceedings of the 24th edition of the Great Lakes Symposium on VLSI (GLSVLSI '14), Houston, United States, 2014-05-21 - 2014-05-23
Organisations:
EEE
Identifiers
Local EPrints ID: 365106
URI: http://eprints.soton.ac.uk/id/eprint/365106
ISBN: 978-1-4503-2816-6
PURE UUID: 05e35808-2239-4e22-a7e1-d40b6aa2bca2
Catalogue record
Date deposited: 22 May 2014 11:17
Last modified: 15 Mar 2024 02:39
Export record
Altmetrics
Contributors
Author:
Manoj Kumar
Author:
Vijay Laxmi
Author:
Manoj Gaur
Author:
Masoud Daneshtalab
Author:
Seok-Bum Ko
Author:
Mark Zwolinski
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics