Implement new GC algorithms for better performances (A)

• Advice : contact Peter since he has ideas about the subject and could give good practices to avoid breaking jnode for such a task
• You should have read this and understood at least the Basic Algorithm. In the terms of that page, JNode's gc is a conservative, non-moving, non-generational, stop-the-world mark&sweep algorithm. Improvements can be many-fold, basicaly removing one of the "non"s Good information with much stuff about memory management and garbage collection can also be found on this site. You can find another explanation of the naive mark&sweep, with a graph on this site
• Level : This can be anything from easy to extremly hard. Depends on actual task.
• Assigned to : Loïc Rouchon, Benoit Sautel and Ismael Merzaq

    The git repository is located here