3 ms·
please forgive my ignorance, but aren't you basically describing a "mark and sweep"[1]? [1] https://en.wikipedia.org/wiki/Mark_and_sweep#Moving_vs._non-moving
by howeyc 12y ago
please forgive my ignorance, but aren't you basically describing a "mark and sweep"[1]?
[1] https://en.wikipedia.org/wiki/Mark_and_sweep#Moving_vs._non-moving https://en.wikipedia.org/wiki/Mark_and_sweep#Moving_vs._non-...
- aidenn0 12y agoI think that's closer to Cheney's algorithm (which is one of the easier ones to make bounded-latency actually).
- ChikkaChiChi 12y agoI'm new to these concepts, so please forgive me for coming up with something that already exists. I guess then the question becomes why would the roadmap avoid such an implementation?
- hedgehog 12y agoC4 is a well known pauseless GC, the paper is good and digging through the citations will get you pretty caught up on the theory and practice: http://www.azulsystems.com/sites/default/files/images/c4_paper_acm.pdf http://www.azulsystems.com/sites/default/files/images/c4_pap...