Parallel Logic Synthesis Using Partitioning
نویسندگان
چکیده
In this paper, we present a partitioning approach of parallel logic synthesis, which is diierent from the previous approaches which involved parallelization of individual operations within the synthesis algorithm. We partition the given logic circuits and distribute the partitions to diierent processors for synthesis. For good load balancing, partitioning algorithm is tuned so that the estimated synthesis times of individual partitions are equal. To improve the quality of synthesized circuits, we propose a novel iterative repartitioning and resynthesis approach to parallel logic synthesis. Experimental evaluation in several large circuits are shown on a network of workstations , and results are compared with MIS.
منابع مشابه
Title : Parallel Synthesis of Large Combinational Circuits for Fpgas Parallel Synthesis of Large Combinational Circuits for Fpgas
Presentation mode : Standard Poster + (eventually) software demonstration/documentation access via rlogin to Unix workstation and WWW access to our site. Abstract. High level synthesis tools are the main stream today for the rapid design of electronic circuits. At a lower level, logic synthesis systems like SIS 3] are in charge of the optimization of the combinational part of the circuit. These...
متن کاملDynamic Fitness Function for Parallel Evolutionary Partitioning Algorithms in the Context of Parallel Logic Simulation
Parallelization of logic simulation is a promising way to accelerate verification processes for whole processor designs. Partitioning of hardware models influences the efficiency of following parallel simulations essentially. Within the frame of a 2-level hierarchical partitioning scheme Parallel Evolutionary Algorithms are successfully applied using a lazy communication strategy. Introducing a...
متن کاملRecon gurable Multi - FPGA Architectures ?
This paper presents an integrated design system called sparcs (Synthesis and Partitioning for Adaptive Reconngurable Computing Systems) for automatically partitioning and synthesizing designs for recon-gurable boards with multiple eld-programmable devices (fpgas). The sparcs system accepts design speciications at the behavior level, in the form of task graphs. The system contains a temporal par...
متن کامل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 tota...
متن کاملTiming-driven partitioning and timing optimization of mixedstatic-domino implementations
| Domino logic is a circuit family that is wellsuited to implementing high-speed circuits. Synthesis of domino circuits is more complex than static logic synthesis due to the non-inverting nature of the logic and the complex timing relationships associated with the clock scheme. In this paper, we address several problems along a domino synthesis ow. We mainly consider the problem of partitionin...
متن کامل