I'm looking at a 2D memory with a 5x5 access parallel access, and the exhaustive banking found a hierarchical scheme N=5, alpha=List(1), B=1 | N=5, alpha=List(1),B=1 and another scheme N=64, alpha=List(1, 8), B=1. The current cost of depth * totalBanks is giving the hierarchical scheme, but now this means there are a bunch of mods and divides to handle the Ns = 5 which ends up being way more expensive.
Also I just realized this cost metric doesn't consider padding either right now. Will fix
mattfel1
commented
5 years ago
I'm looking at a 2D memory with a 5x5 access parallel access, and the exhaustive banking found a hierarchical scheme
N=5, alpha=List(1), B=1 | N=5, alpha=List(1),B=1and another schemeN=64, alpha=List(1, 8), B=1. The current cost ofdepth * totalBanksis giving the hierarchical scheme, but now this means there are a bunch of mods and divides to handle the Ns = 5 which ends up being way more expensive.Also I just realized this cost metric doesn't consider padding either right now. Will fix