Abstract. Software-based self-test has been proposed as a low-cost strategy for on-line periodic testing of embedded processors. However, for complex processors, the number of possible combinations of self-test routines may be huge, and the selection of a
presented later in Section 4, has three testable components (c=3), and the self-test library includes four routines (s=4) for each component. A test program for this processor is composed of three routines, one for each component. Thus, there are 64 (sc) possible test programs for the Java processor with the defined self-test library. However, only a subset of the possible test programs can actually be performed by a real-time embedded processor. In fact, as detailed in [7], some test programs are too large and do no fit the available memories. In other cases, the test program has a long execution time, leading to deadlines misses in the application. Therefore, a method for the definition of a suitable test program is necessary.
We have proposed such a method in [7], considering small processors. First, the method evaluates all possible combinations of self-test routines (64 possible programs, in the case of the Java processor mentioned above). Test programs that do not meet real-time and memory requirements are eliminated. Then, from the remaining suitable programs, the one that minimizes a single cost factor defined by the designer (data or program memory size, or test period) is chosen. In addition to the selected set of self-test routines, the method provides the minimum test period (time between two executions of the self-test program) for which real-time tasks meet their deadlines as defined by the application.
Although the solution proposed in [7] ensures the periodic execution of the test program and the fulfillment of the target platform and application limits, an exhaustive search is performed to find the best test program. Therefore, the method is inappropriate when the solutions space is very large. This may happen when a complex embedded processor is used, as we show next.
Let us consider, for instance, the test of a Very Long Instruction Word (VLIW) processor, like the C6000TM DSP core from Texas Instruments, with eight functional units and two register banks [8] (c=10). If the self-test library with four routines per component is used as before (s = 4), there will be 410 = 1,048,576 possible test programs. If we include other self-test routines with test response compaction code, and the test of other components, following the test priority presented in [4]), the search for a suitable solution will become unfeasible with an exhaustive method.
Thus, it is clear that an efficient heuristic to select a suitable set of self-test routines is necessary. Such a heuristic is proposed in the next section, using a constraint-based approach, where the system-imposed requirements guide the selection process. With this approach, one ensures that a feasible test program is generated. At the same time, the search method tries to find a solution that minimizes a cost function defined by the designer. The cost function is a combination of weighted cost variables, such as memories sizes, power consumption, test execution time, etc, where different weights define the optimization priority of each cost factor.
3. Test Program Search Method
The selection process receives four inputs: a self-testing library, the application characteristics, the system constraints, and the cost function to be optimized.
The self-test library contains several self-test routines for each testable component of the processor. Different SBST approaches can be used to test each component [3-
An efficient constraint handling method for genetic...In this paper, GA's population-based approach ...selection operator are exploited to devise a ...
FCSCAN An Efficient Multiscan-based Test Compression Technique for Test Cost Reduction Abstract — This paper proposes a new multiscan-based test input data ...
AN EFFICIENT STEP SIZE SELECTION FOR ODE CODES ...initial value problems, based on a formula tailor...[3], applying the embedded Runge–Kutta method ...
An object-based design m... 暂无评价 39页 免费...An Efficient Constraint-... 暂无评价 11页 免费喜欢...Test Selection Method to Validate Concurrent Progra...
Carbon-Based Solid Acid as an Efficient and Reusable Catalyst for Cross-Aldol Condensation of K_专业资料。维普资讯 http://www.cqvip.com 第2 9卷第 7期...
Learning efficient query... 暂无评价 14页 免费 Constraint-Based Query O.....Therefore, the EBL method can be interleaved straightforwardly with normal ...
Focusing on bus-based communication protocols, we present a novel, efficient...An Ef?cient TDMA Synchronization Approach for Distributed Embedded Systems Vilgot...
An Efficient Constraint-... 暂无评价 11页 免费 embedded processor based......cient method to extract constraints from a test program template and ...
A Constraint-based Frame... 暂无评价 13页 免费 A RDF-based Framework fo...Smartcard, or smart card, is a plastic card with an embedded microcomputer...
Efficient cost measure... 暂无评价 13页 免费 Motion...An Ef?cient Computation-Constrained Block-Based Motion...and a computational constraint explicitly incorpo...
热门文档