A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits

@article{Heyman2002ASP,
  title={A Scalable Parallel Algorithm for Reachability Analysis of Very Large Circuits},
  author={Tamir Heyman and Daniel Geist and Orna Grumberg and Assaf Schuster},
  journal={Formal Methods in System Design},
  year={2002},
  volume={21},
  pages={317-338}
}
This paper presents a scalable method for parallelizing symbolic reachability analysis on a distributed-memory environment of workstations. We have developed an adaptive partitioning algorithm that significantly reduces space requirements. The memory balance is maintained by dynamically repartitioning the state space throughout the computation. A compact BDD representation allows coordination by shipping BDDs from one machine to another. This representation allows for different variable orders… CONTINUE READING

Similar Papers

Loading similar papers…