Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

DSD
2009
IEEE

favoriteEmaildiscussreport

118views Hardware» more DSD 2009»

The Case for a Balanced Decomposition Process

14 years 6 months ago

The Case for a Balanced Decomposition Process

Download cs.felk.cvut.cz

—We present experiments with synthesis tools using examples which are currently believed to be very hard, namely the LEKU examples by Cong and Minkovich and parity examples of our construction. In both cases, we found a way to produce reasonable results with existing tools. We identify the abilities that are crucial for achieving such results, and also generalize them to avoid similar cases of poor performance in future tools.

Jan Schmidt, Petr Fiser

Real-time Traffic

DSD 2009 | Hardware | LEKU Examples | Parity Examples | Synthesis Tools |

claim paper

Related Content

» Methods for Constructing Balanced Elimination Trees and Other Recursive Decompositions

» Data Distribution Strategies for Domain Decomposition Applications in Grid Environments

» Decompositions of Natural Numbers From a Case Study in Mathematical Theory Exploration

» Balanced allocations the weighted case

» A new graphtheoretic multiobjective layout decomposition framework for double patterning l...

» Load Balancing Concurrent BPEL Processes by Dynamic Selection of Web Service Endpoints

» Balanced Incomplete Factorization

» Balanced Aspect Ratio Trees Revisited

» Performance Analysis of Domain Decomposition Applications Using Unbalanced Strategies in G...

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	DSD
Authors	Jan Schmidt, Petr Fiser

Comments (0)