4 ms·
It's hard to make a concurrent GC that also allows for the kind of super-cheap allocation that OCaml depends on for its performance characteristics. Allocation
by throwaway894345 7y ago
It's hard to make a concurrent GC that also allows for the kind of super-cheap allocation that OCaml depends on for its performance characteristics. Allocation is expensive in Go, for example, but this is okay because Go has value semantics and an imperative model (no need to allocate memory on every little operation). Not sure how Haskell's GC works, but I'm guessing it more or less depends on Haskell's immutability guarantees.
EDIT: Downvoters, I'm genuinely interested in hearing from you. Did I accidentally cause offense or am I mistaken?
- gpderetta 7y agoJava does have cheap allocations and a (many?) scalable multithread friendly GCs though. I guess they did require many many man hours to implement and count as hard?
- throwaway894345 7y agoJava's GC is an impressive piece of engineering with a whole lot of investment, and even then (at least until very recently) it came at the cost of high stop-the-world pause times.
- pjmlp 7y agoIt wasn't recently if you were willing to shell out the bucks. Aonix, PTC, Aicas, IBM have been selling real time JVMs for embedded OSes and bare metal deployments for quite several years, before Azul came into the picture with their pause-less GC for multi-GB heaps (which still does minimal pauses anyway). So recently is more the addition of Azul's ideas into Shenandoah, ZGC in OpenJDK, and Metronome in OpenJ9 as free beer GC for the Java community.
- The_rationalist 7y agoZGC say hello :)
- kccqzy 7y agoI didn't downvote you, but you are mistaken. I don't know about Go GC but your comment about Haskell is very off. > Not sure how Haskell's GC works, but I'm guessing it more or less depends on Haskell's immutability guarantees. This is false. Just because you see immutability on the surface doesn't mean the GC still sees a lot of immutability. Several reasons. The first is that even pure code can depend on interior mutability in a safe way using the ST monad, or in an unsafe way using the IO monad. (The GC can't just say, I give up when a user uses an unsafe function.) You might think that interior mutability is rarely used, but that'd still be wrong. Even something as commonplace as a hash map (from unordered-containers) uses interior mutability under the hood. Just read the source code and you'll see it. Here: http://hackage.haskell.org/package/unordered-containers-0.2.10.0/docs/src/Data.HashMap.Base.html http://hackage.haskell.org/package/unordered-containers-0.2.... Just grep for runST. The bigger problem is laziness. How is laziness implemented? A value is represented as an unevaluated thunk, a closure to compute the value. When the value is needed, the closure is run and then replaced by the resulting data. This is mutability. And this is something that almost every Haskell program relies on. I've explained this many times on HN. See eg https://news.ycombinator.com/item?id=21674749 https://news.ycombinator.com/item?id=21674749
- __s 7y agoIt isn't entirely false. Haskell's GC can take some shortcuts when dealing with immutable objects as they can't reference objects older than themselves, including referencing themselves
- hope-striker 7y agoReally? I have no experience with Haskell's internals, but self-referential objects are fairly common in Haskell thanks to its non-strictness. The simplest one is probably the list with one element repeated forever. ones = 1:ones
- kccqzy 7y agoIf objects can't reference themselves, do you think recursion is impossible in Haskell? powersOf2 = 0 : scanl (+) 1 (tail powersOf2) fibonacci = 0 : scanl (+) 1 fibonacci As I have already explained, immutable objects in Haskell often use laziness. And laziness requires mutability.
- dnautics 7y agoErlang's gc is excellent and very much concurrent, but depends on architectural assumptions you don't get on other languages.
- jeremyjh 7y agoErlang doesn't really have concurrent gc, instead it uses shared nothing heaps and copies values everytime a process sends a message to another process.
- dnautics 7y agoand all of those copies have to be garbage collected, concurrently to the operations being run. Memory isn't infinite on long-lived servers.
- jeremyjh 7y agoNo, there is no concurrent garbage collection happening. When a process is running user code, it is not being garbage collected and vice versa. It happens at an individual process level, but the process is definitely paused while its heap is collected. It has similar benefits to concurrent garbage collection such as the fact that there is never a stop-the-world-pause, and short pauses (since the heaps are typically very small), but it is not the same and means different trade-offs and tuning may be required at the extremes.
- dnautics 7y ago> When a process is running user code, it is not being garbage collected and vice versa That doesn't make it 'not a garbage collector' and it also doesn't make it 'not concurrent'. > tuning may be required at the extremes that is very rare, and if that is disqualifying for a concurrent GC, then Java is disqualified as a concurrent GC.
- jeremyjh 7y agoIt is not "qualified" because the process using a heap is paused while the heap is collected. In a concurrent GC, nothing is paused.