A parallel state assignment algorithm for finite state machines

David A. Bader, Kamesh Madduri

Research output: Contribution to journalArticlepeer-review

4 Scopus citations


This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to overcome the computational complexity involved in the optimization of large sequential circuits. FSMs constitute an important class of logic circuits, and state assignment is one of the key steps in combinational logic optimization. The SMP-based parallel algorithm - based on the sequential program JEDI targeting multilevel logic implementation - scales nearly linearly with the number of processors for FSMs of varying problem sizes chosen from standard benchmark suites while attaining quality of results comparable to the best sequential algorithms.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'A parallel state assignment algorithm for finite state machines'. Together they form a unique fingerprint.

Cite this