3 ms·
On the one hand that's kind of cool, but also really sad. We should do better.
by mpweiher 9y ago
On the one hand that's kind of cool, but also really sad. We should do better.
- hinkley 9y agoThere was a lot of progress on GC in the nineties, a couple advances in type theory, a new way to organize databases, and at least two new families of compression algorithm. It's not all downhill.
- sedachv 9y ago> a new way to organize databases Is this referring to graph databases, or something else?
- hinkley 9y agoLog structured merge tree.
- wbl 9y agoI'm not aware of the GC progress. Generational with compacting young and mark-sweep old has been around since Smalltalk irrc. Was it making it concurrent?
- hinkley 9y agoEvery issue of SIGPLAN in the late nineties had a new paper on improvements or alternatives to generational collectors. Off the top of my head, page marking, to reduce old generation collection, then we had pretenuring and that expanded into escape analysis in 99 or the '00s Superpipelining interpreters and inlining polymorphic dispatch are some of my favorites for the '00s.
- naasking 9y agoThe first cycle collectors for reference counting too, so backup tracing wasn't required.
- rbehrends 9y agoIt's more that progress has become more incremental, while most of the low-hanging fruit has already been picked (as in other disciplines). But progress has not stopped. For example, contrast what the 1996 and 2011 editions of the Garbage Collection Handbook have to say on (hard) real-time garbage collection. Real-time GC has seen a lot of progress since 2000. And there have been also plenty of discoveries in other areas. For example, Monte-Carlo tree search, as used by Go-playing programs, is about a decade old [1]. [1] https://hal.inria.fr/inria-00116992/document https://hal.inria.fr/inria-00116992/document