A unified approach to the decomposition and re-decomposition of sequential machines
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Espresso-HF: a heuristic hazard-free minimizer for two-level logic
DAC '96 Proceedings of the 33rd annual Design Automation Conference
A Parallel Algorithm for State Assignment of Finite State Machines
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
ProperPLACE: A Portable Parallel Algorithm for Standard Cell Placement
Proceedings of the 8th International Symposium on Parallel Processing
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
High-Performance algorithm engineering for large-scale graph problems and computational biology
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hi-index | 0.00 |
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.