Explore >> Select a destination
|
You are here 
|
blog.pnkfx.org | ||
| | | | |
without.boats
|
|
| | | | | [AI summary] The post explains the overview and implementation of a tracing garbage collector in Rust, specifically within the Shifgrethor project, covering concepts like rooted memory, mark-and-sweep phases, and linked list structures. | |
| | | | |
boats.gitlab.io
|
|
| | | | | In the previous post I said that in the second post in the series we'd talk about how rooting works. However, as I sat down to write that post, I realized that it would be a good idea to back up and give an initial overview of how a tracing garbage collector works - and in particular, how the underlying garbage collector in shifgrethor is implemented. In the abstract, we can think of the memory of a Rust program with garbage collection as being divided into three sections: the stack, the "unmanaged" heap... | |
| | | | |
v8.dev
|
|
| | | | | Orinoco, V8's garbage collector, evolved from a sequential stop-the-world implementation into a mostly parallel and concurrent collector with incremental fallback. | |
| | | | |
www.sebastiansylvan.com
|
|
| | | [AI summary] The author discusses design principles for modern, high-performance garbage-collected languages, contrasting approaches like C++, Rust, Java, and Go regarding memory ownership, per-thread heaps, and tracing versus reference counting. | ||
