Research in the area of memory management includes mechanisms for dividing the heap into thread-local heaps and a shared heap. Partitioning of the heap allows the collector to avoid traversing the entire object graph when identifying unused memory. Existing heap partitioning schemes segregate objects into thread-local heaps based on an analysis of their use. A novel method is proposed that will partition the heap as the programmer specifies. These heaplets would be able to select a memory management policy based on their memory usage patterns.