TDM virtual-circuit configuration for network-on-chip

被引:45
作者
Lu, Zhonghai [1 ]
Jantsch, Axel [1 ]
机构
[1] Royal Inst Technol, Dept Elect Comp & Software Syst, SE-10044 Stockholm, Sweden
关键词
logical network; network-on-chip (NoC); quality of service (QoS); time division multiplexing (TDM); virtual circuit;
D O I
10.1109/TVLSI.2008.2000673
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In network-on-chip (NoC), time-division-multiplexing (TDM) virtual circuits (VCs) have been proposed to satisfy the quality-of-service requirements of applications. TDM VC is a connection-oriented communication service by which two or more connections take turns to share buffers and link bandwidth using dedicated time slots. In the paper, we first give a formulation of the multinode VC configuration problem for arbitrary NoC topologies. A multinode VC allows multiple source and destination nodes on it. Then we address the two problems of path selection and slot allocation for TDM VC configuration. For the path selection, we use a backtracking algorithm to explore the path diversity, constructively searching the solution space. In the slot allocation phase, overlapped VCs must be configured such that no conflict occurs and their bandwidth requirements are satisfied. We define the concept of a logical network (LN) as an infinite set of associated (time slot, buffer) pairs with respect to a buffer on a given VC. Based on this concept, we develop and prove theorems that constitute sufficient and necessary conditions to establish conflict-free VCs. They are applicable for networks where all nodes operate with the same clock frequency but allowing different phases. Using these theorems, slot allocation for VCs is a procedure of assigning VCs to different LNs. TDM VC configuration can thus be predictable and correct-by-construction. Our experiments on synthetic and real applications validate the effectiveness and efficiency of our approach.
引用
收藏
页码:1021 / 1034
页数:14
相关论文
共 13 条
[1]  
[Anonymous], 2004, P DES AUT TEST EUR C
[2]  
Bang-Jensen J, 2000, Digraphs: Theory, Algorithms and Applications, V1st
[3]   A router architecture for connection-oriented service guarantees in the MANGO clockless network-on-chip [J].
Bjerregaard, T ;
Sparso, J .
DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, VOLS 1 AND 2, PROCEEDINGS, 2005, :1226-1231
[4]  
BOLOTIN E, 2003, J SYST ARCH DEC
[5]   Deterministic many-to-many hot potato routing [J].
Borodin, A ;
Rabani, Y ;
Schieber, B .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (06) :587-596
[6]   BOUNDS ON MAXIMUM DELAY IN NETWORKS WITH DEFLECTION ROUTING [J].
BRASSIL, JT ;
CRUZ, RL .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1995, 6 (07) :724-732
[7]   AEthereal network on chip: Concepts, architectures, and implementations [J].
Goossens, K ;
Dielissen, J ;
Radulescu, A .
IEEE DESIGN & TEST OF COMPUTERS, 2005, 22 (05) :414-421
[8]  
Hansson A., 2005, P INT C HARDW SOFTW
[9]  
LU Z, 2007, P INT C COMP AID DES
[10]  
NILSSON E, 2004, P INT C HARDW SOFTW