A parallel algorithm for state assignment of finite state machines

Optimization of huge sequential circuits has become unmanageable in CAD of VLSI due to enormous time and memory requirements. In this paper, we report a parallel algorithm for the state assignment problem for finite state machines. Our algorithm has three significant contributions: It is an asynchronous parallel algorithm portable across different MIMD machines. Time and memory requirements reduce by a factor of P (the number of processors), enabling it to handle large problem sizes which the sequential algorithm fails to handle. The quality of the results for multiprocessor runs remains comparable to the sequential algorithm on which it is based.

[1]  John A. Chandy,et al.  A library-based approach to portable, parallel, object-oriented programming: interface, implementation, and application , 1994, Proceedings of Supercomputing '94.

[2]  P. R. Stephan,et al.  SIS : A System for Sequential Circuit Synthesis , 1992 .

[3]  Prithviraj Banerjee,et al.  A Parallel Algorithm for State Assignment of Finite State Machines , 1998, IEEE Trans. Computers.

[4]  Prithviraj Banerjee.  Parallel algorithms for VLSI computer-aided design , 1994 .

[5]  Srinivas Devadas,et al.  Optimum and heuristic algorithms for finite state machine decomposition and partitioning , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[6]  Srinivas Devadas,et al.  Implicit state transition graphs: applications to sequential logic synthesis and test , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Alberto L. Sangiovanni-Vincentelli,et al.  MUSTANG: state assignment of finite state machines targeting multilevel logic implementations , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Tiziano Villa,et al.  NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations , 1989, 26th ACM/IEEE Design Automation Conference.

[9]  Jonathan Rose,et al.  Parallel standard cell placement algorithms with quality equivalent to simulated annealing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Prithviraj Banerjee,et al.  Parallel algorithms for VLSI circuit extraction , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Prithviraj Banerjee,et al.  Simulated annealing based parallel state assignment of finite state machines , 1997, Proceedings Tenth International Conference on VLSI Design.

[12]  John A. Chandy,et al.  Parallel algorithms for logic synthesis using the MIS approach , 1995, Proceedings of 9th International Parallel Processing Symposium.