-
## Issue description
Computing Jacobians for large/complex calculations can produce computational graphs too large to fit in memory, however a finite difference Jacobian does not need to store the …
-
### Search first
- [X] I searched and no similar issues were found
### What Happened?
Loading a page with over ~20 links is slow now when before it was basically instantaneous
### Reproduc…
-
Right now, the call graph can contain `CompositeBloq`s as nodes.
- composite bloqs can be quite large and quite expensive to hash and check equality, which are operations we assume are very cheap…
-
### Is your feature request related to a problem? Please describe.
In a larger cluster, opening the dashboard on port 5691 often results in requests getting stuck at a global `embedded_back_pressures…
-
https://bencher.dev/perf/ratatui-org
We have one metric which measures a worst case scenario and which is much larger than all the rest. This means that it dominates the graph
Turning that o…
-
**Is your feature request related to a problem? Please describe.**
On writing large zarr stores, the [xarray docs](https://xarray.pydata.org/en/stable/user-guide/io.html#appending-to-existing-zarr-st…
-
**Describe the bug**
Uptime CI Takes enormously long to run and fails sometimes
**To Reproduce**
I have my own corn, which trigger workflow run every 5 minutes (because GitHub is not too …
-
This plan captures our work in **September**. This is a 4-week iteration. We will ship in **early October**.
## Endgame
- **September 23, 2024**: Endgame begins
- **September 27, 2024**: Endgame done…
-
Hey,
Thanks for the implementation, but what is the maximum instance size (no. of nodes) for which this implementation is capable of delivering solutions within a short time (lets say a few seconds…
-
### 🐛 Describe the bug
I have a set of extremely large graphs on which I would like to train a NN to classify nodes.
The training procedure would have to go through a lot of slow Python code to co…