ejean said:almost EDA algorithms are 'NP hard'
it means you may get different results in different machines, different platforms, different memory sizes, it is a 'relatively' optimized result, not 'absolutely'.
linuxluo said:Hi, Shockie
I think the same result means that the result timing is under your constraints, that's OK. But not means the detail circuit is the same between twice synthesis. In my design ,each time I find some difference can happen, but the function and timing is correct.
linuxluo said:Hi, Shockie
I think the same result means that the result timing is under your constraints, that's OK. But not means the detail circuit is the same between twice synthesis. In my design ,each time I find some difference can happen, but the function and timing is correct.
ejean said:h**p://w*w*w.i*e*o*r.b*e*r*k*e*l*e*y.e*d*u/~hochbaum/html/book-aanp.html
NP-hard is not NP-complete, but it's 'hard' to solve. In other words, it's a very high BigO algorithm problem.
To solve such kind of problem, we need some 'heuristic'. It need a 'seed', from the seed(an initial value), we can reach a merely relatively optimized result, just as routing, floorplanning, and etc. But it's very difficult to get the absolutely optimized result when the design enormous increasing. We need the 'trade-off' between speed and size, speed and power, and so on. That's why a delicated design so hard.
We use cookies and similar technologies for the following purposes:
Do you accept cookies and these technologies?
We use cookies and similar technologies for the following purposes:
Do you accept cookies and these technologies?