37782928
A multi-dimensional version of the I test
Abstract Two-dimensional arrays with linear subscripts occur quite frequently in real programs. In general, for multi-dimensional linear arrays under constant bounds the Lambda test is an efficient data dependence method to check whether there exist real solutions. In this paper, we propose a multi-dimensional version of the I test, the multi-dimensional I test, that can be applied to testing whether there are integer solutions for multi-dimensional linear arrays under constant limits. Experiments with benchmark showing the effects of the multi-dimensional I test on testing precision and testing efficiency are also presented.
13064248
Path-based multicast communication in wormhole-routed star graph multicomputers
In this paper, we propose four efficient multicast routing schemes in wormhole-routed star networks with multidestination routing capability. All of the four proposed schemes are path-based and deadlock-free. The first scheme, dual-path routing, sends the message in parallel through two independent paths. The second one, shortcut-node-based datapath routing, is similar to dual-path routing except that the routing tries to find a shortcut node to route the message as soon as possible to reduce the length of transmission path. The third one, multipath routing, is a multiple dual-path routing strategy that includes source-to-relay and relay-to-destination phases. The last scheme, proximity grouping routing, is similar to multipath routing except that in the partitioning step of source and destination nodes the relation of spatial locality of nodes is also taken into account to reduce the length of transmission paths. Finally, the experimental results are given to show that the performance based on unicast-based and traditional Hamiltonian-path routing schemes can be improved significantly by the four proposed routing schemes respectively.
42221171
The generalized Direction Vector I test
Abstract The Direction Vector I (DVI) test [IEEE Transaction on Parallel and Distributed Systems 4 (11) (1993) 1280] is an efficient and precise data dependence method to determine whether integer solutions exist for one-dimensional arrays with constant bounds under any given direction vectors. In this paper, we generalize the (DVI) test. The generalized Direction Vector I (GDVI) test can be applied towards determining whether integer solutions exist for one-dimensional arrays with both constant and variable limits under any given direction vectors, improving the precision and applicability of the DVI test. Experiments with benchmark showed that among 12 152 pairs of tested one-dimensional arrays consisting of the same pair of array references with different direction vectors, 2124 had their data dependence analysis amended by the GDVI test. That is, the GDVI test increases the success rate of the DVI test by approximately 17.5%.
24078054
Greedy wire-sizing is linear time
The greedy wire-sizing algorithm (GWSA) has been experimentally shown to be very efficient, but no mathematical analysis on its convergence rate has ever been reported. In this paper, we consider GWSA for continuous wire sizing. We prove that GWSA converges linearly to the optimal solution, which implies that the run time of GWSA is linear with respect to the number of wire segments for any fixed precision of the solution. Moreover, we also prove that this is true for any starting solution. This is a surprising result because previously it was believed that in order to guarantee convergence, GWSA had to start from a solution in which every wire segment is set to the minimum (or maximum) possible width. Our result implies that GWSA can use a good starting solution to achieve faster convergence. We demonstrate this point by showing that the minimization of maximum delay and the minimization of area subject to maximum delay bound using Lagrangian relaxation can be sped up by more than 50%.
776801
Optimizing SOC Test Resources using Dual Sequences
In this paper, we propose a new data structure called dual sequences to represent SOC test schedules. Dual sequences are used together with a simulated annealing based procedure to optimize the SOC test application time and tester resources. The problems we consider are generation of optimal test schedules for SOCs and minimizing tester memory and test channels. Results of experiments conducted on ITC’02 benchmark SOCs show the effectiveness of the proposed method.
38628485
Dilation-5 Embedding of 3-Dimensional Grids into Hypercubes
We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5.
5829648
Closed form solution to simultaneous buffer insertion/sizing and wire sizing
In this paper, we consider the delay minimization problem of an interconnect wire by simultaneously considering buffer insertion, buffer sizing and wire sizing. We consider three cases, namely using no buffer (i.e., wire sizing alone), using a given number of buffers, and using the optimal number of buffers. We provide elegant closed form optimal solutions for all three problems. These closed form solutions are useful in early stages of the VLSI design flow such as logic synthesis and floorplanning.
34361185
Dilation-5 embedding of 3-dimensional grids into hypercubes
We present an algorithm to map the nodes of a 3-dimensional grid to the nodes of its optimal hypercube on a one-to-one basis with dilation at most 5.<<ETX>>