Message-ID:

If a listener nods his head when you're explaining your program, wake him up.

devel / comp.arch.fpga / Synthesis : Pan's Algorithm

Synthesis : Pan's Algorithm

<c2cdd0e1-b106-44af-993e-bd08ba71818dn@googlegroups.com>

https://www.rocksolidbbs.com/devel/article-flat.php?id=191&group=comp.arch.fpga#191

X-Received: by 2002:a37:7047:: with SMTP id l68mr31218307qkc.417.1625750739320;
Thu, 08 Jul 2021 06:25:39 -0700 (PDT)
X-Received: by 2002:a37:468b:: with SMTP id t133mr32073835qka.244.1625750739169;
Thu, 08 Jul 2021 06:25:39 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.arch.fpga
Date: Thu, 8 Jul 2021 06:25:38 -0700 (PDT)
Injection-Info: google-groups.googlegroups.com; posting-host=66.96.206.149; posting-account=7ina5AoAAACwB2uWEr_PlF4Un8PBXR64
NNTP-Posting-Host: 66.96.206.149
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <c2cdd0e1-b106-44af-993e-bd08ba71818dn@googlegroups.com>
Subject: Synthesis : Pan's Algorithm
From: feiphung@gmail.com (promach)
Injection-Date: Thu, 08 Jul 2021 13:25:39 +0000
Content-Type: text/plain; charset="UTF-8"

by: promach - Thu, 8 Jul 2021 13:25 UTC

Have anyone studied Pan's Algorithm previously ?

http://people.eecs.berkeley.edu/~alanmi/publications/2005/iwls05_smr.pdf#page=3

https://i.imgur.com/GO8s4BU.png

1. How is Pan's algorithm being a shortest-path algorithm when clock period is computed across the critical path (longest path) ?

2. Any idea about the modified version of Pan's algorithm described in Figure 2 on page 4 ?

http://people.eecs.berkeley.edu/~alanmi/publications/2005/iwls05_smr.pdf#page=4

3. How does Howard's algorithm avoids re-mapping of the non-critical nodes ?

https://twin.sci-hub.do/5837/84bca870f4f7cc8a1ff7ea72d2d6de8e/algorithms-and-computation-2010.pdf#%5B%7B%22num%22%3A8305%2C%22gen%22%3A0%7D%2C%7B%22name%22%3A%22FitH%22%7D%2C730%5D

http://people.eecs.berkeley.edu/~alanmi/publications/2005/iwls05_smr.pdf#page=5

4. It seems that Figures 2 and 3 of another paper : An Integrated Technology Mapping Environment resemble Pan's Algorithm ?
Why do the paper authors state that for a given node, the fanin are known at current optimization iteration, but the fanouts are known only for the previous optimization iteration ?

https://people.eecs.berkeley.edu/~alanmi/research/iwls05/iwls05_env.pdf#page=3