Optimizing Data Intensive Flows for Networks on Chips

Data flow analysis and optimization is considered for homogeneous rectangular mesh networks. We propose a flow matrix equation which allows a closed-form characterization of the nature of the minimal time solution, speedup and a simple method to determine when and how much load to distribute to processors. We also propose a rigorous mathematical proof about the flow matrix optimal solution existence and that the solution is unique. The methodology introduced here is applicable to many interconnection networks and switching protocols (as an example we examine toroidal networks and hypercube networks in this paper). An important application is improving chip area and chip scalability for networks on chips processing divisible style loads

Recursive Solution of Equilibrium State Probabilities for Three Tandem Queues with Limited Buffer Space

A recursive method for solving for the equilibrium state probabilities of a three tandem queue network with limited buffer space is presented. A set of 4x4 linear equations is solved at each step of the recursion, resulting in large computational savings. Such tandem networks are useful for modeling packets or calls flowing over sequential paths. 1