Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Asynchronous parallel algorithms for test set partitioned fault simulation

Asynchronous parallel algorithms for test set partitioned fault simulation We propose two new asynchronous parallel algorithms for 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. These algorithms provide the same result as the previous synchronous two stage approach. However, due to the dynamic characteristics of these algorithms and due to the fact that there is very minimal redundant work, they run faster than the previous synchronous approach. A theoretical analysis comparing the various algorithms is also given to provide an insight into these algorithms. The implementations were done in MPI and are therefore portable to many parallel platforms. Results are shown for a shared memory multiprocessor. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGSIM Simulation Digest Association for Computing Machinery

Asynchronous parallel algorithms for test set partitioned fault simulation

Loading next page...
 
/lp/association-for-computing-machinery/asynchronous-parallel-algorithms-for-test-set-partitioned-fault-uvh0NyYGDZ

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1997 by ACM Inc.
ISSN
0163-6103
DOI
10.1145/268823.268898
Publisher site
See Article on Publisher Site

Abstract

We propose two new asynchronous parallel algorithms for 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. These algorithms provide the same result as the previous synchronous two stage approach. However, due to the dynamic characteristics of these algorithms and due to the fact that there is very minimal redundant work, they run faster than the previous synchronous approach. A theoretical analysis comparing the various algorithms is also given to provide an insight into these algorithms. The implementations were done in MPI and are therefore portable to many parallel platforms. Results are shown for a shared memory multiprocessor.

Journal

ACM SIGSIM Simulation DigestAssociation for Computing Machinery

Published: Jul 1, 1997

There are no references for this article.