Content deleted Content added
m Cleaning Expand tags from stubs + general cleanup using AWB (7310) |
|||
Line 16:
Cheney's algorithm seems to produce among the ''worst possible'' structures if locality-of-reference is desired - objects referenced by other objects are neatly splattered across the entire heap due to the breadth-first-search implicit to the algorithm. And, yet, the lack of any requirement for a stack (which is necessary for a depth-first search) is part of what keeps Cheney's algorithm itself quite simple. If you need a KISS garbage collector and wish to avoid other structures and bit manipulations, Cheney's is about as simple as it gets. If you need a more optimal one, you'll need to look elsewhere.
It seems to me that thi algorithm is also not thread-save - the whole system has to stop for the gc. A big concern in today (e.g. in smartphones with 8 cores)
[[Special:Contributions/212.95.7.81|212.95.7.81]] ([[User talk:212.95.7.81|talk]]) 01:26, 15 March 2013 (UTC)
| |||