Efficient social graph augmentation schemes for a peer to peer social networking service

Efficient social graph augmentation schemes for a peer to peer social networking service

The dynamic method of identifies sets of faults that can be detected by a single test with a small number of specified bits and explicitly avoid multiple-times detections. In any case, the derived relaxed test sets still include some multiple- Efficient social graph augmentation schemes for a peer to peer social networking service times detections due to coincidental fault detection. In this work, we consider the concept of average fault detection in a test set, defined as follows. Definition The Average Detections of a test set expresses as denotes the average times a fault is detected by a test set .

Efficient social graph augmentation schemes for a peer to peer social networking service Hence, is the total number of detections of all faults in a considered fault list by the tests in the test set divided by the number of faults in . Efficient social graph augmentation schemes for a peer to peer social networking service average detections per fault in and are listed in Columns respectively. Efficient social graph augmentation schemes for a peer to peer social networking service Observe that and are much higher than in these detect test sets, due to the coincidentalfault detections. Both test sets were relaxed using a Efficient social graph augmentation schemes for a peer to peer social networking service technique similar to that ofThe average specified bits reduction fully-specified test sets allow for higher specified bit reduction than partially-specified test sets of similar size. The fault coverage and the test set size of the initial test set are maintained in . Columns and give the and of and , respectively.

Efficient social graph augmentation schemes for a peer to peer social networking services

As expected, based on the discussion of the previous paragraph, the average detections per fault drops in the relaxed test sets, increasing the Efficient social graph augmentation schemes for a peer to peer social networking service number of unspecified bits. The motivation behind relaxing detect test sets is to make these test sets amenable to addressing additional issues beyond detection of the targeted faults. Efficient social graph augmentation schemes for a peer to peer social networking service For example, the unspecified bits can be specified appropriately to detect additional faults such as delay or bridging faults. This process is referred to as test enrichment in Alternatively, the unspecified bits can be specified in such a manner that power dissipation during test set application is minimized The recent work in proposed a new method that takes advantage of the unspecified bits produced by a standard detect ATPG tool, in order to embed multiple detection in a -detect or an -detect test set.

This method can be combined with the work proposed here, in order to maximize the times a fault is detected. In any case, fully specified test sets are finally applied. Since fully-specified test sets take advantage of coincidental fault detections to increase the average detections per fault, relaxed test sets are expected to have the same advantage when they are finally applied. Efficient social graph augmentation schemes for a peer to peer social networking service Columns and give the and of the test set derived after the relaxed test sets and were randomly fully specified. Observe that and . The latter holds since the average fault detections per fault is lower in the original partially specified test set , than in the final fully specified test set . Maintaining average fault detections may not be of much importance in detect test sets, since their goal is to detect the targeted faults. However,