The page faults have thus been greatly reduced. The question naturally arises as to whether these improvements are also reflected in reduced cache misses. We have conducted experiments to answer this question. We have measured cache and TLB misses from the simulation, as well as from direct execution of the programs. Our results indicate that there are small differences in TLB and cache misses between the BFS and DFS approaches.
Implementation here seems to outweigh algorithmic differences.
We also show how small implementation details can substantially affect the locality behaviour of a BDD package. As an example we report results obtained by partially sorting the list of free nodes.