A Novel Design of a Parallel Machine Learnt Generational Garbage\n Collector

The Generational Garbage collection involves organizing the heap into\ndifferent divisions of memory space in-order to filter long-lived objects from\nshort-lived objects through moving the surviving object of each generation\nGarbage Collection cycle to another memory space updating its age and\nreclaiming space from the dead ones. The problem in this method is that the\nlonger an object is alive during its initial generations the longer the garbage\ncollector will have to deal with it by checking for its reachability from the\nroot and promoting it to other space divisions where as the ultimate goal of\nthe Garbage Collector is to reclaim memory from unreachable objects at a\nminimal time possible. This paper is a proposal of a method where the lifetime\nof every object getting into the heap will be predicted and will be placed in\nheap accordingly for the garbage collector to deal more with reclaiming space\nfrom dead objects and less in promoting the live ones to the higher level.\n