Open Access
Subscription or Fee Access
Test Time and Power Optimization of 2D SOCs Using GA and Greedy Algorithm
Abstract
This paper presents a genetic algorithm (GA) and greedy algorithm-based solution to co-optimize test scheduling under power constraint for core-based system-on-chips (SOCs). The core testing solutions are represented as set of wrapper configurations represented in rectangular bins of width equal to the test access mechanism (TAM) bandwidth and height equal to the corresponding test time. A best fit algorithm is used for the wrapper design. Experimental results are obtained for ITC’02 benchmark SOCs. The GA algorithm provides 8% reduction in testing time as compared to the greedy algorithm.
Keywords: genetic algorithm, SOC testing, wrapper design, test scheduling, power constraint
Full Text:
PDFDOI: https://doi.org/10.37591/.v5i2.3186
Refbacks
- There are currently no refbacks.
Copyright (c) 2019 Journal of Power Electronics & Power Systems
eISSN: 2249–863X