On Power-Constrained System-on-chip Test Scheduling Using Precedence Relationships

Harmanani, Haidar M.; Salamy, Hassan A.

On Power-Constrained System-on-chip Test Scheduling Using Precedence Relationships

Harmanani, Haidar M.; Salamy, Hassan A.

URI: http://hdl.handle.net/10725/5459

URL: http://ieeexplore.ieee.org/abstract/document/4016967/

DOI: http://dx.doi.org/10.1109/NEWCAS.2006.250936

Date: 2017-03-29

Terms of Use: This item is made available under the terms and conditions applicable to " Conference Paper / Proceeding ", as set forth at: http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php

Abstract:

This paper presents an efficient method to determine minimum SOC test schedules based on simulated annealing. The problem is solved using a partitioned testing scheme with run to completion that minimizes the number of idle test slots. The method handles SOC test scheduling with and without power constraints in addition to precedence constraints that preserve desirable orderings among tests. The authors present experimental results for various SOC examples that demonstrate the effectiveness of the method. The method achieved optimal test schedules in all attempted cases in a short CPU time

Citation:

Harmanani, H. M., & Salamy, H. A. (2006, June). On Power-Constrained System-On-Chip Test Scheduling Using Precedence Relationships. In Circuits and Systems, 2006 IEEE North-East Workshop on (pp. 125-128). IEEE.