Title :
Optimization of Latency Insensitive Systems Through Back Pressure Minimization
Author :
Bin Xue ; Shukla, Sandeep K. ; Ravi, S.S.
Author_Institution :
Dept. of Electr. & Comput. Eng, Virginia Tech, Blacksburg, VA, USA
Abstract :
In modern System on Chip (SoC) designs, the multi-cycle delays on long interconnects between synchronously clocked IP blocks are accommodated by latency insensitive protocols (LIP) through extra valid/stall handshakes between components and additional logic blocks called relay stations. The use of handshaking interconnects and relay stations leads to area and latency penalties, that must be minimized for cost effective SoC designs. Interconnected IP blocks with certain graph topology have periodic behaviors that can be exploited to remove the need for handshake interconnects. Unfortunately, the periodic schedule may not exist for any LIS designs consist of two or more strongly connected components. Some of these systems are not bounded without back pressure. In the past, back pressure between SCCs has always been implemented as stall signals in the backward direction, and they are required to prevent overflow. In this paper, we propose an LIS design optimization algorithm which computes a minimum set of back pressure arcs required between SCCs. We model an LIS by a partial back pressure graph (PBPG) and show that the boundedness of a PBPG can be verified by checking the reachability in its strongly connected component graph (SCCG). Based on this, we formulate the problem of finding a minimum set of back pressure arcs (MBPA) and show that this problem can be reduced to the Minimum Cost Arborescence (MCA) problem for directed graphs. This allows us to obtain a polynomial time algorithm for synthesizing a minimum cost LIS implementation starting from a synchronous model of the original system. After adding back pressure arcs, we develop a localized Mixed Integer Linear Programming (LMILP) approach to optimize the throughput of the resulting LIS. This approach scales better than existing MILP-based throughput optimization techniques. In addition, we also provide an implementation of the LIS which refines its PBPG model. To the best of our knowledge, this is the first e- fort that considers the optimization of back pressure and throughput together in the design of latency insensitive systems.
Keywords :
computational complexity; directed graphs; integer programming; integrated circuit design; linear programming; microprocessor chips; multiprocessor interconnection networks; system-on-chip; LIP; LIS designs; LMILP approach; MBPA; MCA problem; MILP-based throughput optimization techniques; PBPG model; SCCG; SoC designs; back pressure arcs; back pressure minimization; directed graphs; graph topology; handshaking interconnects; interconnected IP blocks; latency insensitive protocols; latency insensitive system optimization; latency insensitive systems; localized mixed integer linear programming approach; logic blocks; minimum cost arborescence problem; minimum set of backpressure arcs; multicycle delays; partial back pressure graph; periodic behaviors; periodic schedule; polynomial time algorithm; relay stations; strongly connected component graph; synchronously clocked IP blocks; system on chip designs; Clocks; Computational modeling; Gold; IP networks; Optimization; Schedules; Throughput; Latency insensitive system; back pressure; buffer sizes; optimization; throughput;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2013.226