-
Currently the `Node` class used for `ImmutableList` includes 40 bytes of overhead per list element on X64, and 24 bytes of overhead on X86. This means the memory cost of using this data structure for …
-
### Describe the feature
# Overview
Scroll uses a binary Markle Patricia trie (BMPT) to represent it's state. This is different to the standard MPT that ethereum and reth uses. As such we will nee…
-
I'd like to have some sort of real-world benchmarks. Currently, we just have some micro-benchmarks of varying quality.
Here's some research on the topic from more general schedulers...
* In [An …
-
Simply replacing `@benchmarkable` with `@be` suffices, and you don't have to run `tune!` or `run` either!
Even running `Statistics.median(suite)` works - although any custom plotting utilities migh…
-
## ❓ Questions and Help
In my use case I frequently stumble upon this problem of compiler gym services using too much memory.
For example:
```
ray._private.memory_monitor.RayOutOfMemoryError: …
uduse updated
2 years ago
-
Leaf container layers are permissible when building up the layer tree, but should not be present once `buildScene` is called. At best, this is some wasted cycles on some native calls to the SceneBuild…
-
In the frames array of the API output, for each frame the API point to the function declaration in the bundle, for example, for the following bar function, the API would point to between “bar” and the…
-
I've been investigating an issue that Clang has been warning about all
over the place (-Wincompatible-library-redeclaration) and I'd like to
draw attention to it because it implies that people who hav…
-
Using `go1.5`
I discovered that "go test" crashes after the timeout of 600s has passed. I was running all the benchmarks in `compress/flate` and I set `-benchtime 10s`. Since each benchmark will run …
-
The idea is to have an equivalent of function pointer in C or `std::function` in C++11. This could be useful to avoid over specialization (Ref https://github.com/JuliaLang/julia/pull/13412#issuecommen…