A Parallel Transitive Closure Computation Algorithm for VLSI Test Generation

Authors:
Seema Bawa;G. K. Sharma
Affiliations:
-;-
Venue:
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Year:
2002

Citing 12
Cited 0

A linear expected-time algorithm for deriving all logical conclusions implied by a set of Boolean inequalities

Mathematical Programming: Series A and B
Computing dominators in parallel

Information Processing Letters
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing

Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Automatic test generation using quadratic 0-1 programming

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Parallel-processing techniques for automatic test pattern generation

Computer
A Theorem on Boolean Matrices

Journal of the ACM (JACM)
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems
An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Polynomially Complete Fault Detection Problems

IEEE Transactions on Computers
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient scalable parallel algorithm for transitive closure computation and its application to solve VLSI test generation problem. The transitive closure computation is the core of the test generation process and it will take huge time, sometimes unaffordable, if it is computed on serial machines for generating patterns for large practical VLSI circuits. The proposed algorithm divides the transitive closure computation into n 脳 n tasks using data parallelism and it takes polylogarithmic time using polynomial number of processors. Load balancing techniques: static and dynamic and performance metrics like speedup, efficiency, scalability and isoefficiency function are taken into account for the algorithm development. The algorithm, so developed, has been implemented in a heterogeneous distributed computing environment using Parallel Virtual Machine (PVM) and successfully tested by generating test patterns for example practical circuits. Experimental results given in the paper show the effectiveness of the proposed algorithm.