Zeitpunkt Nutzer Delta Tröts TNR Titel Version maxTL Fr 26.07.2024 00:01:07 61.958 +1 3.580.868 57,8 Fosstodon 4.2.10 500 Do 25.07.2024 00:00:10 61.957 +1 3.577.506 57,7 Fosstodon 4.2.10 500 Mi 24.07.2024 00:01:07 61.956 0 3.574.077 57,7 Fosstodon 4.2.10 500 Di 23.07.2024 00:00:03 61.956 -3 3.570.705 57,6 Fosstodon 4.2.10 500 Mo 22.07.2024 00:01:10 61.959 +1 3.567.825 57,6 Fosstodon 4.2.10 500 So 21.07.2024 00:01:07 61.958 +1 3.564.861 57,5 Fosstodon 4.2.10 500 Sa 20.07.2024 00:01:10 61.957 +1 3.561.604 57,5 Fosstodon 4.2.10 500 Fr 19.07.2024 13:57:34 61.956 -1 3.558.474 57,4 Fosstodon 4.2.10 500 Do 18.07.2024 00:00:27 61.957 +1 3.553.476 57,4 Fosstodon 4.2.10 500 Mi 17.07.2024 00:01:10 61.956 0 3.550.157 57,3 Fosstodon 4.2.10 500
Blosc Development Team (@Blosc2) · 12/2022 · Tröts: 84 · Folger: 17
Fr 26.07.2024 13:44
We recently implemented read-ahead capabilities in Blosc2-Python to interleave computation and I/O as much as possible.
In the plot, see how much time and memory take the evaluation of '((a ** 3 + sin(c * 2)) < b) & (c > 0)', where a, b and c are 2-dim arrays of 27 GB each. A comparison with Dask+Zarr is made too. The expression not only evaluates a 1.5x faster, but also uses 3x less memory (!).
Stay tuned for our forthcoming release of Python-Blosc2!
Make compression better 😀
[Öffentlich] Antw.: 0 Wtrl.: 0 Fav.: 0