Abstract: In a computer system, an automatic memory management module operates by receiving, from a mutator, memory allocation requests for particular objects to be stored in a random-access memory and allocating particular logical addresses within a logical address space to the particular objects. The automatic memory management module distinguishes the particular objects according to at least one criterion and allocates logical addresses from a first sub-space and logical addresses from a second sub-space. A memory management unit maps the allocated logical addresses from the second sub-space to physical memory in the random-access memory. The logical addresses within the first sub-space are compacted in combination with moving corresponding objects in the random-access memory.

Abstract: A method for implementation of memory management on a read/write memory of a data processing device, in which a multiplicity of tasks (T1-T6) occupy at least parts of the read/write memory, and parts of the read/write memory that were occupied by the tasks (T1-T6) but are no longer needed are found by way of time-based memory cleanup, and released again. The method includes reserving at least one processor of the data processing device for every task (T1-T6), for a duration of at least one time slot, and performing memory cleanup in free time slots reserved for memory cleanup. Work-based memory cleanup is performed by interrupting the tasks (T1-T6) during the time slots reserved for these tasks, before and/or after every memory allocation, for a specific period of time, for the purpose of memory cleanup.

Abstract: A method for the dynamic management at a read-write memory which permits the storage and removal of objects of different sizes. The method comprises subdividing the read-write memory into memory blocks of a defined size and associating a memory management system with the read-write memory that stores objects according to at least two different methods or storage, either as a contiguous block composed or partial blocks, or as a block composed of distributedly arranged partial blocks. The choice of the respective storage method is based conditions given in advance, depending on the size of the free memory in relation to the size of the objects, such that, when the free memory is larger or equal to the size of the object that is to be stored, the object is stored contiguously, otherwise the object in stored distributedly.