This commit is contained in:
Tiziano Zito 2024-08-05 16:40:36 +02:00
parent 219ed2207a
commit 9b17d7b2d6

View file

@ -4,7 +4,7 @@
## Benchmarks details
- Create in memory a list of `N=128` one dimensional numpy arrays of length `L` starting from `L=2` up to `L=2^22==4_194_304` in steps of powers of two.
- Create in memory a list of `N=128` one dimensional numpy arrays of length `L` starting from `L=2` up to `L=2^22=4_194_304` in steps of powers of two.
- Given that each item of the array is of type `float64`, i.e. 8 bytes, the size of the arrays goes from `16B` to `32M`
- The total memory required is at least `128 × 32M × 2 = 8G`
- Load the whole list in one big numpy array of size `N`x`L` (*good*) and `L`x`N` (*bad*). The corresponding loops are: