Jatindra Kumar Deka

An Outlier Detection Method Based on Clustering

In this paper we propose a clustering based method to capture outliers. We apply K-means clustering algorithm to divide the data set into clusters. The points which are lying near the centroid of the cluster are not probable candidate for outlier and we can prune out such points from each cluster. Next we calculate a distance based outlier score for remaining points. The computations needed to calculate the outlier score reduces considerably due to the pruning of some points. Based on the outlier score we declare the top

An Optimal Diagnosis of NoC Interconnects on Activation of Diagonal Routers

n

Detection of faulty interswitch links in 2-D mesh network-on-chips

points with the highest score as outliers. The experimental results using real data set demonstrate that even though the number of computations is less, the proposed method performs better than the existing method.

Impact of NoC interconnect shorts on performance metrics

Previous works on detecting and locating manufacturing faults-shorts, stuck-at, and open on an interswitch link of a channel in a network-on-chip (NoC) have been based on the assumption that these faults do not coexist. The works failed to diagnose all these faults when this assumption is relaxed. A deficiency for non-diagnosability of these faults is then represented. A packet address driven test strategy that detects and locates a faulty inters witch link in a NoC channel is proposed. The strategy addresses the intra-channel shorts, stuck at, and open faults coexist on inters witch links and is governed by parallel activation of diagonal routers. The strategy is scalable with mesh NoCs. Simulation results achieve 100% and more than 97% fault coverages when faults are diagnosed explicitly and implicitly respectively.

A matrix model for redefining and testing NoC interconnect shorts

The network-on-chip has become an emerging research area in the fields of system on chips, embedded systems, integrated circuits design, etc. with the rapid advancement of technologies. The introduction of multi-core chips has in addition made researches in the area ever significant and is growing to facilitate high demand of bandwidth via core utilization and need of scalable interconnection fabrics. Numerous technical papers have addressed the performance evaluation but a limited attention has been paid on detection of faulty interswitch links in post manufactured network-on-chip setups. Existing works are traditional circuit based but not with respect to current aspects. Main drawbacks of these approaches are high detection time, large test data, and low scalability. In this paper we propose a novel high level detection model for interswitch links in network-on-chips. The detection process is exercised with a set of test patterns to identify faulty links. The model proposes both local and global test generation schemes. A 2-D mesh network-on-chip architecture is considered for experiment. The experimental results show that the proposed detection model outperforms with a finite test patterns set which suffices to test all interswitch links of the underlying network-on-chip.

A packet address driven test strategy for stuck-at faults in networks-on-chip interconnects

Duplication, misrouting, and dropping of packets due to short faults on network-on-chip (NoC) interconnects have become a burden and significant impact on performance metrics. This paper proposes an adaptive approach that detects and locates intra-channel short faults on NoC interconnects, and accounts impact of the faults on performance metrics. The model is scalable with all NoCs. Simulations show the effectiveness of proposed approach and measure different performance metrics with faulty channels on various NoCs.

Min-max computation tree logic

Network-on-chip (NoC) has currently considered as a holistic solution over traditional and global bus-based system-on-chip (SoC) interconnections. However, NoC interconnects experience a subset of manufacturing faults- shorts, opens, and stuck-ats. A limitation of prior works on testing shorts on interconnects of a NoC is that interconnects are tested without coexistent open faults. The works then fail to detect all shorts if a relaxation is made on this assumption. A fast matrix based test strategy that tests and diagnoses shorts with and without coexistent opens on NoC interconnects is proposed. Proposed strategy is scalable irrespective of NoCs and evaluated in terms of test time, test criteria, and performance metrics. Both 100% and near 100% fault coverages are achieved on explicit and implicit testing of shorts respectively. However, 100% test coverage is achieved in either of the cases.

Reliability on Top of Best Effort Delivery: Maximal Connectivity Test on NoC Interconnects

With the rapid advancements of deep submicron and nano technologies the dimension of a chip is ever shrinking. With continuous shrinking of chip dimensions, immense interconnects are associated on a die to satisfy high bandwidth requirements and make a network-on-chip (NoC) architecture prone to large number of interconnect faults. Therefore the reliability becomes a crucial issue for the communicating parties in a NoC communication fabric. This paper presents a packet address driven test strategy that diagnoses NoC interconnects experiencing stuck-at (stuck-at-0 and stuck-at-1) faults. The proposed strategy is scalable to all sizes and types of mesh NoCs and can be extended to other NoCs. The simulation is done on a number of mesh NoCs to establish the scalability. The simulation results show the performance measured in terms of test and fault coverages that can reach to 100% at the expense of few CPU clocks.

An on-line test solution for addressing interconnect shorts in on-chip networks

This paper introduces a branching time temporal query language called Min-max CTL which is similar in syntax to the popular temporal logic, CTL [Clarke et al., ACM Trans. Program. Lang. Systems 8 (1986) 244]. However unlike CTL, Min-max CTL can express timing queries on a timed model. We show that interesting timing queries involving a combination of min and max can be expressed in Min-max CTL. While model checking using most timed temporal logics is PSPACE-complete or harder [Alur and Henzinger, Inform. and Comput. 104 (1993) 35; Alur et al., Inform. and Comput. 104 (1993) 2], we show that many practical timing queries, where we are interested in the worst-case or best-case timings, can be answered in polynomial time by querying the system using Min-max CTL.

Distance based fast outlier detection method

A scalable, packet address driven strategy that tests an open fault on network-on-chip (NoC) interconnects and maximal connectivity between neighbor routers in presence of a short fault is proposed. The open faults and maximal connectivity are tested for data, control, and handshake interconnects by the proposed method using finite test sequence. Experiments ensure the state of faultiness/non-faultiness of an interconnect with/without an open fault and possibility of connectivity over faulty interconnects for a channel. Evaluation is done in terms of test time, testing criteria, and performance metrics. Results achieve 100% test and fault coverages when interconnects possess open faults only but nearly 100% when shorts are injected on faulty interconnects to make connectivity.