Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Feng Shi 0010

dblp:06/468-10 · DBLP profile ↗
← Back
9ranked-venue papers
8as first author
0since 2021 · last 2009
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 9 · 8 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 83% Integrated circuit design · 17%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
fault simulation
0.112009
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits · IEEE Trans. Computers 2009
Electronic design automation › hardware verification and test
hardware verification
0.112009
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits · IEEE Trans. Computers 2009
Electronic design automation › hardware verification and test
logic simulation
0.112009
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits · IEEE Trans. Computers 2009
Integrated circuit design
asynchronous circuit design
0.012009
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits · IEEE Trans. Computers 2009
Integrated circuit design › asynchronous circuit design
speed-independent circuits
0.012009
Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits · IEEE Trans. Computers 2009

Methods — techniques the papers use, named apart from their topics

time-stamp partial orders · 0.1hazard detection · 0.113-valued algebra · 0.1
YearPublicationVenuePosition
2009 Enhancing Simulation Accuracy through Advanced Hazard Detection in Asynchronous Circuits
abstract
A fast and accurate simulator with elaborate hazard detection capabilities is vital for asynchronous circuits, not only for the purpose of design validation through logic simulation, but even more importantly for the purpose of test validation through fault simulation. Towards this end, we developed SPIN-SIM, a logic and fault simulator built around Eichelbergerpsilas classical hazard detection method, yet extended in various ways in order to overcome its limitations. More specifically, in order to improve simulation accuracy and hazard detection, SPIN-SIM i) employs a 13-valued algebra for which it adapts Eichelbergerpsilas method, ii) maintains partial orders of causal signal transitions through relative time-stamps, and iii) unfolds time-frames judiciously to distinguish between hazards and actual transitions. Experimental results demonstrate that, at the cost of a negligible increase in computational time over Eichelbergerpsilas method, if any at all, SPIN-SIM achieves significantly more accurate logic simulation and, by extension, drastically more efficient fault simulation. Furthermore, while the proposed method was developed and is presented for the class of speed-independent circuits, it is easily extendible to various other classes of asynchronous circuits.
Feng Shi 0010, Yiorgos Makris
IEEE Trans. Computers1
2009 Soft-Error Tolerance and Mitigation in Asynchronous Burst-Mode Circuits
abstract
We discuss the problem of soft errors in asynchronous burst-mode machines (ABMMs), and we propose two solutions. The first solution is an error tolerance approach, which leverages the inherent functionality of Muller C-elements, along with a variant of duplication, to suppress all transient errors. The proposed method is more robust and less expensive than the typical triple modular redundancy error tolerance method and often even less expensive than previously proposed concurrent error detection methods, which only provide detection but no correction. The second solution is an error mitigation approach, which leverages a newly devised soft-error susceptibility assessment method for ABMMs, along with partial duplication, to suppress a carefully chosen subset of transient errors. Three progressively more powerful options for partial duplication select among individual gates, complete state/output logic cones, or partial state/output logic cones and enable efficient exploration of the tradeoff between the achieved soft-error susceptibility reduction and the incurred area overhead. Furthermore, a gate-decomposition method is developed to leverage the additional soft-error susceptibility reduction opportunities arising during conversion of a two-level ABMM implementation into a multilevel one. Extensive experimental results on benchmark ABMMs assess the effectiveness of the proposed methods in reducing soft-error susceptibility, and their impact on area, performance, and offline testability.
Sobeeh Almukhaizim, Feng Shi 0010, Eric Love, Yiorgos Makris
IEEE Trans. Very Large Scale Integr. Syst.2
2006 Testing delay faults in asynchronous handshake circuits
abstract
As a class of asynchronous circuits, handshake circuits are designed to tolerate variation of gate delays. However, certain timing constraints, such as the bundled data assumption, are exploited in the single-rail implementation of these circuits in order to simplify them. Therefore, any delay fault in the circuit may cause one of two problems, namely performance degradation or logic errors. To address the challenges incurred by the autonomous behavior of handshake circuits during at-speed test, we propose test methods for both types of delay faults based on a DFT strategy which greatly simplifies the complexity of test generation. The efficiency of the proposed methodology is demonstrated through experimental results on several handshake circuits.
Feng Shi 0010, Yiorgos Makris
ICCAD1
2005 SPIN-PAC: test compaction for speed-independent circuits
abstract
SPIN-PAC is a static test compaction method for Speed-Independent circuits. We demonstrate how the test sets can be compacted by combining multiple consecutive test vectors within a test sequence into a vector pair of higher Hamming distance, and by eliminating or pruning independent test sequences. We discuss the exponential nature of optimally solving this problem, we propose an efficient algorithm to approximate it, and we evaluate its performance through experiments.
Feng Shi 0010, Yiorgos Makris
ASP-DAC1
2005 Test generation for ultra-high-speed asynchronous pipelines
abstract
We propose a methodology for testing ultra-high-speed asynchronous pipelines, the latest and most promising asynchronous circuit design style. Unlike traditional delay-insensitive asynchronous micro-pipelines, which use slow capture-pass latches, these circuits employ aggressive handshaking protocols and transparent latches between fine-grain pipeline stages, in order to achieve high performance. Their functional robustness, however, relies on certain timing constraints that need to be satisfied. As a result, these circuits are no longer delay-insensitive, which means that stuck-at faults are not always leading to pipeline stalling. In addition, delay faults may result in violation of these timing constraints, thus affecting not only performance, as in delay-insensitive micro-pipelines, but also functional correctness. To address these new challenges, we develop a test method for both stuck-at and timing constraint violation faults in fine-grain ultra-high-speed asynchronous pipelines. The efficiency of the proposed method is demonstrated on MOUSETRAP, a recently developed pipeline for high-speed applications
Feng Shi 0010, Yiorgos Makris, Steven M. Nowick, Montek Singh
ITC1
2004 Fault simulation and random test generation for speed-independent circuits
abstract
We develop a fault simulator for input stuck-at faults in Speed-Independent circuits by extending Eichelberger's method. In order to achieve higher accuracy, a 13-valued algebra is adopted, the relative order of causal signal transitions is maintained, and time frames are unfolded in a careful manner. Based on this simulator, we propose a random test generation algorithm which reduces the probability that the circuit finds itself in non-deterministic states and helps it recover when this happens. Experimental results show that the combination of the two techniques achieves an average improvement of 18% in fault coverage.
Feng Shi 0010, Yiorgos Makris
ACM Great Lakes Symposium on VLSI1
2004 SPIN-TEST: automatic test pattern generation for speed-independent circuits
abstract
SPIN-TEST is a simulation-based gate-level ATPG system for speed-independent circuits. Its core engine is an A* search algorithm which employs an accurate fault simulator and an efficient cost function to guide a deterministic test pattern generation phase. A random test pattern generation phase is also available in order to improve run time. The key ATPG challenge in speed-independent circuits is the generation of patterns that are valid independently of the relative timing and the order of arrival of signals. SPIN-TEST addresses this challenge by guaranteeing fault sensitization with hazard/race-free patterns and response observation that is not affected by oscillations or non-deterministic circuit states. Experimental results on benchmark circuits demonstrate the efficiency of SPIN-TEST in terms of both high fault coverage and low test generation time.
Feng Shi 0010, Yiorgos Makris
ICCAD1
2004 Compiler-Based Frame Formation for Static Optimization
abstract
We selectively generate and optimize the frames constructed by the rePLay architecture statically. Since static analysis provides a global view of the interaction between the basic blocks and a bigger aggressive optimization space, we propose a method to construct the frames using profiling and static analysis. Frame selection and optimization are analyzed in the criteria to produce well-optimized, frequently executed frames with minimum recovery penalty. In addition, hardware support is reduced to only perform mis-speculation recovery. Empirical results show the frame-optimized code outperforming baseline code on the SPEC integer benchmarks.
Feng Shi 0010, Sobeeh Almukhaizim, Pey-Chang Lin, Yiorgos Makris
ICCD1
2004 SPIN-SIM: Logic and Fault Simulation for Speed-Independent Circuits
abstract
We present SPIN-SIM, a logic and fault simulator for speed-independent circuits, that extends the classical Eichelberger's method and overcomes its limitations. In order to improve simulation accuracy. SPIN-SIM adopts a 13-valued algebra, maintains the relative order of causal signal transitions, and unfolds time frames judiciously. In addition, complex gates are handled through replacement by pseudo-gate equivalents with regards to functionality, timing and faulty behavior. Experimental results show that SPIN-SIM incurs a negligible increase in computational time over Eichelberger's method, yet is much more accurate and achieves a significant improvement in fault coverage.
Feng Shi 0010, Yiorgos Makris
ITC1