A Comparison of Parallel Approaches for Algebraic Factorization in Logic Synthesis

Algebraic factorization is an extremely important part of any logic synthesis system but is computationally expensive. Hence it is important to look at parallel processing to speed up the procedure. This paper presents three different parallel algorithms for algebraic factorization. The first algorithm uses circuit replication and uses a divide and conquer strategy. A second algorithm uses totally independent factorization on different circuit partitions with no interactions among the partitions. A third algorithm represents a compromise between the two approaches. It uses a novel L-shaped partitioning strategy which provides some interaction among the rectangles obtained in various partitions.

• Type: Conference
• Year: 1997
• Where: IPPS
• Authors: Sumit Roy, Prithviraj Banerjee
• Keywords: Algebraic Factorization, Algorithm, Algorithm Uses Circuit, Distributed And Parallel Computing, IPPS 1997