The Community for Technology Leaders
2013 IEEE 31st VLSI Test Symposium (VTS) (1997)
Monterey, California
Apr. 27, 1997 to May 1, 1997
ISBN: 0-8186-7810-0
pp: 274
J.H. Patel , Center for Reliable & High Performance Comput., Illinois Univ., Urbana, IL, USA
D. Krishnaswamy , Center for Reliable & High Performance Comput., Illinois Univ., Urbana, IL, USA
E.M. Rudnick , Center for Reliable & High Performance Comput., Illinois Univ., Urbana, IL, USA
P. Banerjee , Center for Reliable & High Performance Comput., Illinois Univ., Urbana, IL, USA
ABSTRACT
We propose three synchronous parallel algorithms for scalable parallel test set partitioned fault simulation. The algorithms are based on a new two-stage approach to parallelizing fault simulation for sequential VLSI circuits in which the test set is partitioned among the available processors, The test set partitioning inherent in the algorithms overcomes the good circuit logic simulation bottleneck that exists in traditional fault partitioned approaches to parallel fault simulation. The implementations were done on a shared memory multiprocessor and on a network of workstations. Two of the algorithms show a small degree of pessimism in a few cases, with respect to the fault coverage as compared with a uniprocessor run, while the third algorithm provides the same results as in a uniprocessor run. All algorithms provide excellent speedups and perform much better than a traditional fault partitioned approach, on both shared and distributed memory parallel platforms.
INDEX TERMS
VLSI; SPITFIRE; scalable parallel algorithms; test set partitioned fault simulation; synchronous parallel algorithms; sequential VLSI circuits; fault coverage
CITATION
J.H. Patel, D. Krishnaswamy, E.M. Rudnick, P. Banerjee, "SPITFIRE: scalable parallel algorithms for test set partitioned fault simulation", 2013 IEEE 31st VLSI Test Symposium (VTS), vol. 00, no. , pp. 274, 1997, doi:10.1109/VTEST.1997.600663
98 ms
(Ver 3.3 (11022016))