Sub-10 ms Latency in Java: Concurrent GC with Green Threads

Re:Sub-10 ms Latency in Java: Concurrent GC with Green Threads by feanaro on Wednesday August 05, 2020 @10:45AM (#24061358)

> This is spectacularly false. For all non-trivial allocation/deallocation patterns, Rust also uses a runtime reference-counting GC, which is significantly slower than the tracing GCs you find in OpenJDK.

Are you talking about `Rc` and similar smart pointer types? If so, the twist is that in Rust almost all allocations in Rust are trivial in this sense.

[ Parent | on HN ]

Re:Sub-10 ms Latency in Java: Concurrent GC with Green Threads by pron on Wednesday August 05, 2020 @12:15PM (#24062473)

There's no "twist". There was a claim that Rust does tracing at compile time; it does not. It's allocation patterns and costs are similar to all other low-level languages. The cost and benefits of such languages are well known.

[ Parent | on HN ]

Re:Sub-10 ms Latency in Java: Concurrent GC with Green Threads by feanaro on Sunday August 09, 2020 @09:10AM (#24099378)

My point was that Rust's compile-time machinery and conventions allow you to avoid using referencing counting smart pointers like `Rc` in almost all cases. What you call trivial patterns of allocation is in fact the prevailing type of allocation in Rust.

[ Parent | on HN ]