portelli/Grid
1
0
Fork 0
mirror of https://github.com/paboyle/Grid.git synced 2025-06-12 20:27:06 +01:00
Code Releases Activity

Allocator cache spliit into large/small pools

Browse Source
This commit is contained in:
Peter Boyle
2020-05-10 05:24:26 -04:00
parent 2bb2c68e15
commit ea08f193e7
4 changed files with 15 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
benchmarks/Benchmark_schur.cc
View File

@ -47,7 +47,7 @@ int main (int argc, char ** argv)
const int Ls=12;
std::vector< std::vector<int> > latts;
#if 0
#if 1
latts.push_back(std::vector<int> ({24,24,24,24}) );
latts.push_back(std::vector<int> ({48,24,24,24}) );
latts.push_back(std::vector<int> ({96,24,24,24}) );
@ -157,7 +157,7 @@ void benchDw(std::vector<int> & latt4, int Ls)
std::cout <<"\t"<<flops/(t1-t0)<<"\t"<<(t1-t0)/1000./1000.<<" s\t";
// Cheby uses MpcDagMpc so 2x flops
for(int i=0;i<100;i++){
for(int i=0;i<1;i++){
Cheby(Mpc,src_o,r_o);
t0=usecond();
Cheby(Mpc,src_o,r_o);