sundial-gc
samsara
sundial-gc | samsara | |
---|---|---|
1 | 10 | |
7 | 77 | |
- | - | |
1.8 | 10.0 | |
over 4 years ago | about 2 years ago | |
Rust | Rust | |
Apache License 2.0 | - |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
sundial-gc
-
Novel Garbage Collection Technique for Immutable Cycle-Free Data
It's not the same, but I made use of immutable monophonic types at compile time generated bitsets representing type relations for a similar purpose in sundial-gc. The design doc is bit out of date, but roughly describes my the implementation. Unfortunately Rusts's type system just is not there yet so the API is holding up the project (blog post pending).
samsara
-
Garbage Collected Smart Pointers in Rust via Concurrent Cycle Collection
A slightly newer attempt which is concurrent - in fact, it aims to implement the algorithm discussed in OP, though there may be some subtle differences in implementation: https://github.com/chc4/samsara
-
Crafting Interpreters with Rust: On Garbage Collection
There's also more recent implementations such as https://github.com/chc4/samsara (quite similar to https://github.com/pebal/sgcl , which is for C++. Both implement a concurrent tracing algorithm whoch allows for reduced latency compared to simple mark+sweep).
-
Tracing Garbage Collection for Arenas
Interesting discussion. If you want to experiment with 'lightweight' traced GC in system programming, you might like https://github.com/chc4/samsara (for Rust) or https://github.com/pebal/sgcl (for C++) both implementing a concurrent tracing algorithm which is a bit more involved than what's directly discussed in OP.
-
Some notes on Rust, mutable aliasing and formal verification
https://github.com/chc4/samsara is also worth looking into, implementing the same concurrent GC algorithm for Rust.
-
Garbage Collection for Systems Programmers
> IME it's the other way around, per-object individual lifetimes is a rare special case
It depends on your application domain. But in most cases where objects have "individual lifetimes" you can still use reference counting, which has lower latency and memory overhead than tracing GC and interacts well with manual memory management. Tracing GC can then be "plugged in" for very specific cases, preferably using a high performance concurrent implementation much like https://github.com/chc4/samsara (for Rust) or https://github.com/pebal/sgcl (for C++).
-
Why choose async/await over threads?
> Just for example: "it needs a GC" could be the heart of such an argument
Rust can actually support high-performance concurrent GC, see https://github.com/chc4/samsara for an experimental implementation. But unlike other languages it gives you the option of not using it.
-
Boehm Garbage Collector
The compiler support you need is quite limited. Here's an implementation of cycle collection in Rust: https://github.com/chc4/samsara It's made possible because Rust can tell apart read-only and read-write references (except for interior mutable objects, but these are known to the compiler and references to them can be treated as read-write). This avoids a global stop-the-world for the entire program.
Cascading deletes are rare in practice, and if anything they are inherent to deterministic deletion, which is often a desirable property. When they're possible, one can often use arena allocation to avoid the issue altogether, since arenas are managed as a single object.
-
Steel – An embedded scheme interpreter in Rust
There are concurrent GC implementations for Rust, e.g. Samsara https://redvice.org/2023/samsara-garbage-collector/ https://github.com/chc4/samsara that avoid blocking, except to a minimal extent in rare cases of contention. That fits pretty well with the pattern of "doing a bit of GC every frame".
-
Removing Garbage Collection from the Rust Language (2013)
There are a number of efforts along these lines, the most interesting is probably Samsara https://github.com/chc4/samsara https://redvice.org/2023/samsara-garbage-collector/ which implements a concurrent, thread-safe GC with no global "stop the world" phase.
-
I built a garbage collector for a language that doesn't need one
Nice blog post! I also wrote a concurrent reference counted cycle collector in Rust (https://github.com/chc4/samsara) though never published it to crates.io. It's neat to see the different choices that people made implementing similar goals, and dumpster works pretty differently from how I did it. I hit the same problems wrt concurrent mutation of the graph when trying to count in-degree of nodes, or adding references during a collection - I didn't even think of doing generational references and just have a RwLock...
What are some alternatives?
book - Writing Interpreters in Rust: a Guide
node-libnmap - API to access nmap from node.js