Consider alternative defaults for data-based synthesis variable ordering algorithms
There are several places where choices can be made: * We can choose the current hyper-edges vs the ones defined in the DCSH paper. (#380) * We can enable DCSH by default or not. (#376) * We can choose per algorithm (DCSH, FORCE, sliding window), to base it on the total span or WES metric. * For the node ordering algorithms, we can choose which pseudo-peripheral node finding algorithm to use. All of this requires that we can determine what is better, hence we need ways to specify these choices (#378), scripts to easily test the differences (#375), and enough benchmarking models to conclude what is really better in general (#364).
issue

Copyright © Eclipse Foundation AISBL. All rights reserved.     Privacy Policy | Terms of Use | Copyright Agent