We discuss the problem of parity tree selection for lossless compaction of the output responses of a circuit. Earlier methods assume off-chip storage of the correct compacted responses and therefore minimize the numbe...
详细信息
We discuss the problem of parity tree selection for lossless compaction of the output responses of a circuit. Earlier methods assume off-chip storage of the correct compacted responses and therefore minimize the number of necessary parity trees. In contrast, our method targets on-chip generation of the correct compacted responses and therefore minimizes the actual implementation cost of the corresponding parity prediction functions. We present a systematic search approach that exploits the correlation between the hardware cost of a function and its entropy, in order to select parity trees that minimize the incurred cost, while achieving lossless compaction. Experimental results demonstrate that our method achieves significant hardware reduction over methods that minimize the number of parity trees.
This paper investigates the applicability of multi-frequency test access mechanism (TAM) design for reducing the system-on-a-chip (SOC) test application time. Based on the bandwidth matching concept the proposed algor...
详细信息
This paper investigates the applicability of multi-frequency test access mechanism (TAM) design for reducing the system-on-a-chip (SOC) test application time. Based on the bandwidth matching concept the proposed algorithms explore a larger solution space, which, as shown by experimental data, can lead to improved test application time.
Multicasting in wireless ad hoc sensor networks, i.e. one terminal sends the same data to multiple receivers, is an active field of research. In this paper, the optimal energy-aware multicast routing was studied in ad...
详细信息
ISBN:
(纸本)0780381939
Multicasting in wireless ad hoc sensor networks, i.e. one terminal sends the same data to multiple receivers, is an active field of research. In this paper, the optimal energy-aware multicast routing was studied in ad hoc sensor networks. The optimal multicast routing problem was formulated as an integer linear programming. A revised particle swarm optimization (PSO) algorithm, multi-phase discrete PSO was applied to solve this NP-hard problem in a distributed computing manner. To deal with the constraints e.g. connectivity constraint and broadcast constraint, a problem-independent constraint handling technique was proposed by introducing symbiosis mechanism to PSO algorithm. The performance of the algorithm was studied with different kinds of networks. Experiment results show that the presented algorithms can effectively solve the multicast routing problem in a reasonable time, even for large scale networks with numerous receivers.
We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.
ISBN:
(纸本)1557527725
We describe a new heuristic for finding a shortest active path with a disjoint backup path (the Min-Min problem), which works better than other heuristics and is also a viable approach for shared path protection.
Narrowing time-to-market windows are driving the design community toward FPGAs. Whereas quick prototype implementations are possible using FPGAs, circuit delays have always been a major concern. Moreover, achieving hi...
详细信息
Narrowing time-to-market windows are driving the design community toward FPGAs. Whereas quick prototype implementations are possible using FPGAs, circuit delays have always been a major concern. Moreover, achieving high performance in FPGAs with densely packed routing resources is difficult because of crosstalk noise. In this paper we describe a very high performance FPGA, and show a simple and practical technique of almost reducing crosstalk noise by using a two-phase nonoverlapping complimentary clocking scheme. An efficient integer linear programming formulation has been proposed to find an optimum solution to a constrained problem, and we have studied the effects and costs of applying our idea to different architectures. Experiments with MCNC benchmark circuits in different architectures of our FPGA show that, on average, we could reduce crosstalk induced delay increases to less than 4% of the clock period. With a minimal increase of 3% in area due to this optimization, our results seem very promising.
The Compaan compiler automatically derives a process network (PN) description from an application written in Matlab. The basic element of a PN is a producer/consumer (P/C) pair. Four different communication patterns f...
详细信息
The Compaan compiler automatically derives a process network (PN) description from an application written in Matlab. The basic element of a PN is a producer/consumer (P/C) pair. Four different communication patterns for a P/C pair have been identified and the complexity of communication structure differs depending on the communication pattern involved. Therefore, in order to obtain cost-efficient process networks our compiler automatically identifies the communication pattern of each P/C pair. This problem is equivalent to integer linear programming and thus in general can not be solved efficiently. In this paper we present simpler techniques that allow classifying the interprocess communication in a PN. However, in some cases those techniques do not allow to find an answer and therefore, an ILP test has still to be applied. Thus, we introduce a hierarchical classification scheme that correctly classifies the interprocess communication, but uses dramatically less integer linear programming, in only 5% of the cases to classify, we still rely on integer linear programming; in the remaining 95%, the techniques presented Are able to classify a case correctly.
We propose the use of multiple gateways to significantly reduce latency and energy consumption in multi-hop wireless sensor networks during data aggregation. We have derived efficient integer linear programming formul...
详细信息
We propose the use of multiple gateways to significantly reduce latency and energy consumption in multi-hop wireless sensor networks during data aggregation. We have derived efficient integer linear programming formulations as well as a novel negative selection statistically-tuned heuristics. The heuristics are based on newly developed relaxation based lower bounds that are also used to quantify the effectiveness of the proposed heuristics. Our simulation study indicates that the use of gateways can often reduce latency and energy consumption by several times.
In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we pr...
详细信息
In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we propose a branch and bound algorithm. Our method is based on a new lower bound and is compared with Ragatz lower bound. New dominance rule and original exploration strategy are also proposed. Preliminary numerical simulations are encouraging and promising.
The problem of wavelength routing and assignment in WDM optical networks is NP-hard. To date, problems of wavelength routing and wavelength assignment have been solved separately to obtain optimal or near-optical solu...
详细信息
The problem of wavelength routing and assignment in WDM optical networks is NP-hard. To date, problems of wavelength routing and wavelength assignment have been solved separately to obtain optimal or near-optical solutions. In this paper, we propose a heuristic approach to wavelength routing that achieves optimal or near optimal solutions with much faster computational time compared to the classical ILP formulation. A two steps approach including K shortest paths (KSP) and integer linear programming selection (ILPS) formulation is presented. This approach can deal with larger network sizes. Tune complexity and optimality of solution are two performance metrics considered in our study. The computational time in ILP formulation increases rapidly (nearly exponential) while those in our approach are nearly flat. The optimality of solutions in our approach depends on the value of the constant K in the KSP process, and in most cases optimal solutions can be achieved when K > 4. For NSFNET with 14 nodes, 21 bidirectional links, 16 wavelengths per link and 100 random traffic matrices of 115 connections, it yields one hundred percent of 46 feasible and optimal solutions when K > 4.
暂无评论