Distributed Mark & Sweep
- Based on the concurrent mark & sweep of Dijkstra.
- The number of computers that can be implied in the marking phase is not
bound (can expands to all the computers in the Internet).
- Termination detection of the marking phase is hard.
- Distributed garbage collection is very tied with the local gargabe
collector.
- 9 -