A Framework for Designing Congestion-Aware Deterministic Routing
2010 (English)In: NoCArc '10 Proceedings of the Third International Workshop on Network on Chip Architectures, 2010, 45-50 p.Conference paper (Refereed)
In this paper, we present a system-level Congestion-Aware Routing (CAR) framework for designing minimal deterministic routing algorithms. CAR exploits the peculiarities of the application workload to spread the load evenly across the network. To this end, we first formulate an optimization problem of minimizing the level of congestion in the network and then use the simulated annealing heuristic to solve this problem. The proposed framework assures deadlock-free routing, even in the networks without virtual channels. Experiments with both synthetic and realistic workloads show the effectiveness of the CAR framework. Results show that maximum sustainable throughput of the network is improved by up to 205% for different applications and architectures.
Place, publisher, year, edition, pages
2010. 45-50 p.
Algorithms, C.2.1 [Network Architecture and Design], Network communications, Design, Performance
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-63728DOI: 10.1145/1921249.1921261ScopusID: 2-s2.0-79951614608ISBN: 978-145030397-2OAI: oai:DiVA.org:kth-63728DiVA: diva2:482535
3rd International Workshop on Network on Chip Architectures, NoCArc 2010, in Conjunction with the 43rd Annual IEEE/ACM International Symposium on Microarchitecture, MICRO-43; Atlanta, GA; 4 December 2010 through 4 December 2010
QC 201202032012-01-242012-01-242013-12-05Bibliographically approved