As we move into the system-on-chip era, test cost is becoming a significant portion of the total cost. Similarly, test synthesis, test pattern generation, pattern compression and pattern validation are consuming signi...
详细信息
As we move into the system-on-chip era, test cost is becoming a significant portion of the total cost. Similarly, test synthesis, test pattern generation, pattern compression and pattern validation are consuming significant portion of the design cycle time. the volume of test generation and validation is high due to the size of the designs as well as the types of tests that are required to be run - scan test patterns for stuck-at and delay tests, logic and memory BIST patterns, IDDQ tests, burn-in tests, and several miscellaneous tests. Designs cannot be taped out without validated test patterns. At the same time, since design timing closure takes up a significant portion of the project time and the timing information is not available until late in the schedule, there is immense pressure on the DFT team to generate and validate patterns in a small time frame. this paper describes a framework for design-for-test which exploits both hierarchy and the inherent parallelism in the DFT jobs to run the jobs in a distributedcomputing environment so as to minimize the runtime impact.
Our results are based on measurements carried out in a residential house in suburban area of Zagreb town, as well as in a medium-size office building (seven stories, approx. 150 offices) in the Zagreb city center, dur...
Our results are based on measurements carried out in a residential house in suburban area of Zagreb town, as well as in a medium-size office building (seven stories, approx. 150 offices) in the Zagreb city center, during two moths (late August, September and early October 2003). the noise samples were collected in five whole-day (6 am–10 pm) campaigns. those five days were equally distributed over the two-month period. Noise was measured withthe spectrum analyzer, built in the instrument Anritsu Site Master S114B, between the neutral (N) and protection (PEN) wire, so that virtually no 50 Hz voltage was present on the analyzer port. Anyways, we have provided a simple overvoltage protection for the instrument, in case a temporary network fault occurs. We have studied noise on N-PEN pair because there is a technically well grounded tendency that this wire-pair, and not the neutral-phase or phase-phase, should be utilized for PLC systems, [1]. Beside noise measurements, we also carried out simultaneous measurements of the actual office building electrical load, by periodically reading its meter. this was needed for the investigation of correlation properties between the electrical load and total noise power in the 10 to 30 MHz band. In all measurements we have recorded both noise samples from one analyzer scan (lasting about 5 seconds), thus obtaining "temporary" shots, and 5 minutes maximal values, using max-hold function of the instrument. We found 5 minutes maximums interesting because of rapid temporal fluctuations in noise power levels. Resolution bandwidth of the analyzer was 10 kHz. On all figures in this article we use noise power levels in dBm recorded by the instrument withthat resolution.
A real-world challenge in data science is to develop interactive methods for quickly analyzing new and novel data sets that are potentially of massive scale. In this talk, we discuss our development of suffix array an...
详细信息
ISBN:
(纸本)9781450384049
A real-world challenge in data science is to develop interactive methods for quickly analyzing new and novel data sets that are potentially of massive scale. In this talk, we discuss our development of suffix array and graph algorithms in the context of Arkouda, a NumPy-like replacement for interactive data science on tens of terabytes of data. Many real-world applications in bioinformatics, web information search and analysis, and lossless compression can be abstracted as string analysis. Suffix arrays are a very efficient data structure to support quick search of any string patterns. We have integrated the suffix array data structure (including its enhanced Longest Common Prefix (LCP) array) and the corresponding construction algorithm into Arkouda, thus providing Python users with a powerful method to support different types of string analysis. Our novel approach integrates a suffix array algorithm library into Arkouda so that the Arkouda runtime can select the large suffix array construction algorithm dynamically based on the dataset properties. Two of the implemented methods on the back-end of Arkouda include our novel O(n) time complexity skew algorithm in Chapel, and the DivSufSoft suffix array construction algorithm in C, which has higher time complexity but often is faster in practice. Experimental results show that, supported by Arkouda, Python users can build a large scale string's suffix array and LCP array in a Jupyter notebook easily without losing any performance compared withthe directly back-end operation. Our future work is extending our self-developed algorithm to support multi-locale parallel execution, so that our algorithm can handle large strings on distributedsystems. Graphs are widely used to abstract problems in domains such as social sciences, biological systems, and information systems. To support real-world large graph analysis in Arkouda, we first developed the array-based graph data structure which can be used like an adjacency matri
暂无评论