Parallel probing: dynamic and constant time setup procedure in circuit switching NoC

Authors:
Shaoteng Liu;Axel Jantsch;Zhonghai Lu
Affiliations:
KTH Royal Institute of Technology, Sweden;KTH Royal Institute of Technology, Sweden;KTH Royal Institute of Technology, Sweden
Venue:
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
Year:
2012

Citing 8
Cited 1

SoCBUS: Switched Network on Chip for Hard Real Time Embedded Systems

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Energy-Aware Communication and Task Scheduling for Network-on-Chip Architectures under Real-Time Constraints

Proceedings of the conference on Design, automation and test in Europe - Volume 1
Guaranteed Bandwidth Using Looped Containers in Temporally Disjoint Networks within the Nostrum Network on Chip

Proceedings of the conference on Design, automation and test in Europe - Volume 2
A unified approach to constrained mapping and routing on network-on-chip architectures

CODES+ISSS '05 Proceedings of the 3rd IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Æthereal Network on Chip: Concepts, Architectures, and Implementations

IEEE Design & Test
A Network-on-Chip Channel Allocator for Run-Time Task Scheduling in Multi-Processor System-on-Chips

DSD '08 Proceedings of the 2008 11th EUROMICRO Conference on Digital System Design Architectures, Methods and Tools
System design of full HD MVC decoding on mesh-based multicore NoCs

Microprocessors & Microsystems
Design and Implementation of Backtracking Wave-Pipeline Switch to Support Guaranteed Throughput in Network-on-Chip

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Costs and benefits of flexibility in spatial division circuit switched networks-on-chip

Proceedings of the Sixth International Workshop on Network on Chip Architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a circuit switching Network-on-chip with a parallel probe searching setup method, which can search the entire network in constant time, only dependent on the network size but independent of the network load. Under a specific search policy, the setup procedure is guaranteed to terminate in time 3D+6 cycles, where D is the geometric distance between source and destination. If a path can be found, the method succeeds in 3D+6 cycles; if a path cannot be found, it fails in maximum 3D+6 cycles. Compared to previous work, our method can reduce the setup time and enhance the success rate of setups. Our experiments show that compared with a sequential probe searching method, this method can reduce the search time by up to 20%. Compared with a centralized channel allocator method, this method can enhance the success rate by up to 20%.