16447326
An Approximate Method for Performance Evaluation of Asynchronous Pipeline Rings
Performance evaluation of asynchronous circuits is one of the most difficult parts in asynchronous circuit research. This Paper presents an approximate method by queuing network modeling for performance evaluation of asynchronous pipeline rings. The asynchronous pipeline rings are modeled by closed queuing networks with transfer blocking. An efficient approximation method is used to analyze the performance metrics, such as response time and throughput. These performance metrics can be used to derive the cycle time and latency of the asynchronous pipeline rings. Compared with theoretic results, the algorithm presented in this paper is efficient for performance evaluation of asynchronous pipeline rings.
32146489
Cycle Period Analysis and Optimization of Timed Circuits
In this paper, a method is proposed to analyze the minimum average cycle period of the timed circuits. Timed Petri net is used to model timed circuits. Our method is focus on structural analysis of the Petri net model of the timed circuits, which is another way to reduce the state space of the analyzed model. Then an algorithm is proposed to optimize the performance of timed circuit by asynchronous retiming technique. The algorithm balances the asynchronous pipelines to gain the target cycle period while minimize the area at the same time. Experimental results demonstrate the computational feasibility and effectiveness of both approaches.
11142145
An Optimal Design Method for De-synchronous Circuit Based on Control Graph
De-synchronous is a very useful method to design asynchronous circuit automatically from synchronous description of circuits. This paper introduces an optimal design method based on Control Graph which is an abstract model of the de-synchronous circuit. The main purpose of this optimal design method is to reduce the extra overhead in the area of the de-synchronous circuit. The optimization algorithm takes the performance evaluation function based on the Control Graph of the de-synchronous circuit as its heuristic function. The performance evaluation function presented in this paper is a linear programming problem. In the end of this paper, the optimal method is applied to a set of benchmark circuits. The number of the local controllers in these circuits is markedly reduced by 54%, and the number of C-elements that is required to construct the handshake circuitry between local controllers is also reduced by 76.3%. So the entire area of the circuit is sharply reduced. Because this design method is directed by the performance evaluation function of the circuit, there is no penalty in performance of the de-synchronous circuit.
7324862
A New Description Language for Data-Driven Asynchronous Circuits and its Design Flow
A lot of up-to-date asynchronous circuit design tools are based on the control-driven asynchronous circuit style, such as Balsa and Haste/Tangram. The control-driven approach will limit the performance of the result circuits. To improve the performance of the asynchronous circuits, a new description language - Biscotti, which is suitable for the data-driven asynchronous circuit design, has been introduced in this paper. And a data-driven asynchronous circuit design flow is also be presented here. The experimental results show that this design flow is a fast and efficient way to design the data-driven asynchronous circuit, which can achieve higher performance compared with the control-driven design approach.
22959134
The Design of Asynchronous Microprocessor Based on Optimized NCL_X Design-Flow
NCL X circuit is a very efficient way to implement the QDI circuit, which can get all the advantages of the asynchronous circuit, especially the average performance. But the NCL_X circuits suffer from its huge area overhead. To solve this problem, a method for optimizing the complete detection network in the NCL_X circuit has been introduced in this paper. Using this method can dramatically reduced the area of the NCL_X circuit, according to the experimental result, the area of the NCL_X circuit may be reduced more than 60%. We also use this optimized method to implement an asynchronous microprocessor pipeline (APC). Compared to the synchronous implementation, this NCL_X implementation can achieve higher performance because the NCL_X circuit can get the average performance.
17076624
Performance Bound Analysis and Retiming of Timed Circuits
Timed asynchronous circuits are efficient in performance and power consumption. Traditional performance analysis method can not analyze timed circuits efficiently. In this paper, we model timed circuits using timed Petri net and digraph. We studied the mean cycle time of timed Petri net model. The upper bound and lower bound of mean cycle time were given. Then we proposed an algorithm for timed circuits retiming. The algorithm can efficiently distribute buffers along communication channels of timed circuits to gain maximal performance and minimal area. These algorithms were applied to phased logic circuitspsila design and optimization.
45698420
An Approximate Solution for Queuing Network Models of a Burst-Level Traffic Control Scheme in ATM WAN
Abstract This paper proposes a closed queuing network model for a burst-level traffic control scheme in ATM WAN environments, and explores solution techniques for this model. An approximate solution technique is developed to solve the closed queuing networks with multiple chains, chain-dependent service times, MSFIFO (multiple servers first-in first-out) queues, and simultaneous resource possession. Results of this study show that, with respect to the subnetwork algorithm of Souza e Silva and Muntz [Approximate solution for a class of non-product form queuing network models, Performance Evaluation (7) (1987) 221–242], our algorithm is advantageous, because (1) it is applicable to queuing network models with nested first-allocated/first-released passive resources; (2) it greatly reduces the complexity of the subnetwork algorithm by not decomposing the network and representing the complements; (3) it achieves higher accuracy and provides more reliable conservative estimates; and (4) it is easy to understand due to its straightforward interpretation.
31834649
A Novel Artificial Immune Network Model and Analysis on Its Dynamic Behavior and Stabilities
A novel model of artificial immune network is presented at first, and then a simulative research work is made on its dynamic behaviors. Simulation results show that the limit cycle and chaos may exist simultaneously when four units are in connection, and the network's characteristic has a close relationship with the intensity of suppressor T-cell's function, B-cell's characteristics and transconductance. Besides this, with Liapunov's method, the sufficient conditions for network's stability is studied, especially for the case of system's characteristics under the condition that the helper T-cells appear as a nonlinear function.
38710648
A Resource Allocating Neural Network Based Approach for Detecting End-to-End Network Performance Anomaly
Automatic detection of end-to-end network performance anomalies is important to efficient network management and optimization. We present an end-to-end network performance anomalies detection method, based on characterizing of the dynamic statistical properties of RTT normality. The experiment on real Internet end-to-end path RTT data shows that, the proposed method is accurate in detecting performance anomalies, it can successfully detect about 96.25% anomalies in the experiment.
5145569
Automatic Ontology Derivation Using Clustering for Image Classification
Technology in the field of digital media generates huge amounts of non-textual information, audio, video, and images, along with more familiar textual information. The potential for exchange and retrieval of information is vast and daunting. The key problem in achieving efficient and user-friendly retrieval in the domain of image is the development of a search mechanism to guarantee delivery of minimal irrelevant information (high precision) while insuring that relevant information is not overlooked (high recall). The traditional solution to the problem of image retrieval employs contentbased search techniques based on color, texture or shape features. The traditional solution works well in performing searches in which the user specifies images containing a sample object, or a sample textural pattern, in which the object or pattern is indexed. One can overcome this restriction by indexing images according to meanings rather than objects that appear in images, although this will entail a way of converting objects to meanings. We have solved this problem of creating a meaning based index structure through the design and implementation of a concept-based model using domain dependent ontologies. An ontology is a collection of concepts and their interrelationships which provide an abstract view of an application domain. With regard to converting objects to meaning the key issue is to identify appropriate concepts that both describe and identify images. We propose a new mechanism that can generate ontologies automatically in order to make our approach scalable. To achieve this we propose a method for the automatic construction of ontologies based on clustering and a vector space model. Similarity of images is based on similarity of objects that appear in images. For object similarity measure, we consider the combination of color and shape similarity together.
6464793
Ringed Petersen spheres connected hypercube interconnection networks
On the basis of the short diameter of Petersen graph, and high connectivity of hypercube, a novel interconnection networks, RPSCH(n) (ringed Petersen spheres connected hypercube) is proposed, and whose characteristics are studied simultaneously. It is proved that RPSCH(n) is not only of regularity and good extensibility, but also of shorter diameter and better connectivity than those previous well-known interconnection networks such as Q/sub n/, RP(n) and HP(n). In addition, the unicasting and broadcasting routing algorithms are designed for RPSCH(n), whose communication efficiency are proved to be n-2 and n-2 respectively.