137 results about "Dynamic memory management" patented technology

Disclosed are systems and methods for managing memory. A memory management system may include a table having multiple virtual memory addresses. Each virtual memory address may correspond to a physical memory address and data that identifies a type of memory device corresponding to the physical memory address. The physical memory device can be used to access the memory device when a table hit occurs.

With better knowledge of the behavior of objects in a running application, it is possible to improve execution environment decisions that affect management of such objects. For example, if available, object lifetime statistics could be employed in decisions that affect how and where objects are placed, e.g., on allocation or during operation of automatic dynamic memory management facilities such as a garbage collector. Typically, instrumenting all objects to sample lifetimes or other characteristics would impose an impractical level of overhead. We present a technique for dynamic sampling of a subset of allocated objects that incurs low runtime overheads. Coupled with automatic memory management or collection facilities, this technique allows us to improve the efficiency of a collector by segregating objects, sampled and non-sampled alike, based on observed characteristics such as object lifetime. The sampling techniques facilitate tracking of many kinds of object information. For purposes of illustration, an exemplary implementation is described in which such sampling techniques are exploited to improve performance of generational garbage collectors.

The invention relates to a dynamic memory management method. The prior memory management method influences the utilization rate and the real-time performance of the memory. The dynamic memory management method of the invention comprises the following steps of memory allocation, memory recycle and address mapping, and has the details that a memory unit is divided into memory pages with the same size, and data which are logically connected are allowed to be stored in the memory pages which are not physically connected. The invention adopts the way of combining a counter and FIFO to manage the memory pages, so as to enable the memory allocation and the memory recycle to be more flexible, and the external fragment problem during the memory allocation is eliminated, thereby the utilization rate of the memory is improved, and the allocation and the recycle of the memory have the characteristics of real-time performance and predictability.

A method, system, and program for dynamic memory management of unallocated memory in a logical partitioned data processing system. A logical partitioned data processing system typically includes multiple memory units, processors, I/O adapters, and other resources enabled for allocation to multiple logical partitions. A partition manager operating within the data processing system manages allocation of the resources to each logical partition. In particular, the partition manager manages allocation of a first portion of the multiple memory units to at least one logical partition. In addition, the partition manager manages a memory pool of unallocated memory from among the multiple memory units. Responsive to receiving a request for a memory loan from one of the allocated logical partitions, a second selection of memory units from the memory pool is loaned to the requesting logical partition. The partition manager, however, is enabled to reclaim the loaned selection of memory units from the requesting logical partition at any time.

A method and apparatus for allocating and deallocating memory in a multi-processing system. Each unit of user memory has an associated control block. All units of user memory are contiguous as are all control blocks. Available user memory blocks are stored in linked lists, one linked list for each range of user memory block sizes. When a user memory block is allocated, a memory block is seized using a linked list of adequate size memory blocks; the surplus of the adequate size memory block beyond what is needed in the request for user memory is retained as available user memory and is added to another appropriate linked list of available memory. When deallocating, both the memory block being deallocated and, if available, the previous and/or next memory block are added to create a merged memory block. The merged memory block is then restored as available memory and added to the appropriate one of the linked lists of available memory blocks while the previous and/or next memory blocks, if available, are removed from the list of available memory blocks of the size of the previous or next block.

The invention relates to a real-time dynamic memory manager for a multi-core real-time system, in particular to a real-time dynamic memory manager achieving method for multi-core processor. Cache shared by a physical memory and the multi-core processor is divided into a monopoly area, a shared area, a communication area and a non-real-time area by the page coloring technique, spare page management systems are respectively built for the monopoly area and the shared area, the communication area is packed by various synchronous mechanisms to achieve high-speed communication between tasks based on Cache, and the non-real-time area is managed by a host operation system. The real-time dynamic memory manager achieving method for the multi-core processor divides a memory and the Cache into a plurality of independent areas, prevents high priority hard real-time tasks from being interfered by other tasks through the Cache and improves system real time performance and stability. Thus, a high speed communication mechanism based on tasks of the Cache is achieved to further improve system real time performance.

The invention discloses a highly-concurrent real-time memory resource management and scheduling method, which includes the steps: initializing by allocating memory with designated quantity as a management heap, dividing the memory into a plurality of memory blocks and setting up a mapping module through a memory management module; performing memory management by creating a local heap for a current thread and maintaining the corresponding relationship between the local heap and the current thread through the mapping module after a thread needing dynamic memory management is added to the memory management module; and allocating dynamic memory by returning the memory to the current thread and completing the current thread after service logic of the current thread is processed. The method solves the problem of bottleneck in concurrent memory resource scheduling on modern multi-core high-end commerce servers, so that hardware resource potential of modern computers is sufficiently explored without changing any codes of a traditional application system, and real-time running efficiency of a software system is greatly improved.

The invention discloses a memory allocation method, comprising the following steps: S1, establishing and initializing a segment tree structure for a memory to be managed; S2, applying for the memory by a kernel or an application program; and S3, recovering the memory released by the kernel or the application program by a segment tree. Physical memory management is performed by adopting the segment tree mode, thereby ensuring that the provided memory address is in physical continuity, efficiently applying for the memory with the specific physical address without influencing the overall performance, and overcoming the defects that the common memory management is easy to generate memory fragments, the efficiency is low, the continuity of the physical address can not be ensured and the like.

The invention provides a memory management method, a memory management system and a server, belonging to the technical field of the server. The memory management method comprises the following steps: presetting at least two memory pools which comprise frequently-used memory chain tables and big memory chain tables according to the size of the memory; receiving the user's request for applying for the memory and positioning the memory pool according to the size of the memory applied by the user; controlling and allotting the memory of the frequently-used memory chain table reading the memory pool to the user applying for the memory when there is available memory in the frequently-used memory chain table of the positioned memory pool; controlling and allotting the memory of the big memory chain table reading the memory pool to the user applying for the memory when there is no available memory in the frequently-used memory chain table of the positioned memory pool. The invention has high memory allotting efficiency and high memory allotting concurrency and realizes that the plurality of memory pools correspond to a plurality of parallel threads.

In a method, system and apparatus for management of dynamic memory in battery-powered devices, information is stored in dynamic memory, such as SDRAM chips. Chip partitioning minimizes the number of chips requiring power, minimum refresh rates reduce the power needed to maintain information, and a threshold for determining when to power down a battery powered device are used to maximize battery life.

The disclosure is a method and apparatus for operating dynamic memory management with an object-oriented program, by which objects with frequent creation and short life spans are allocated to a unit memory block in sequence. After released from the unit memory block, the objects are added on a free re-use list so as to be reused when there is an invocation of allocation for the same object size. It is advantageous to enhancing system performance.

One or more memory coalitions of software processes are created and used to decide whether to perform memory reduction operations on a data processing system. One method in one embodiment includes adding a newly launched second process to an existing memory coalition in response to determining that the second process should be part of a memory coalition that includes a first process. In response to determining that available system memory (e.g. DRAM) is low, the system determines which memory coalition of foreground applications uses the most amount of system memory and then performs one or more memory reduction operations on that memory coalition in order to make more system memory available to other processes.

The invention relates to an embedded software memory management system, and relates to the technical field of embedded software memory management. According to the system, a static allocation method is adopted, the number of partitions in a system memory area and the number and size of memory blocks in each partition are preset, a dynamic memory allocation method is adopted on the memory area of auser based on a pool type memory management mechanism, memory requests and release requests are processed by creating a memory allocator, and traditional dynamic memory allocation and a release algorithm are improved. According to the system, flexibility of the system is enhanced by adopting a combined method of statically allocating the system memory area and dynamically allocating the system memory area, meanwhile generation of a large number of fragments is limited to prevent the occurrence of memory leaks, and the method can effectively reduce time consumption of requesting and memory releasing, so that management efficiency of dynamic memory is improved.

The embodiment of the invention provides a dynamic memory management method and a mobile terminal and relates to the technical field of mobile terminals. The dynamic memory management method comprises obtaining the memory usage of a currently-running application in the mobile terminal; determining whether the memory usage of the currently-running application is higher than the corresponding memory upper limit of the application, which is correlated with the use condition of the application within a preset time period; if so, executing a memory cleaning operation or displaying a preset prompt message. According to the dynamic memory management method and the mobile terminal, the memory upper limit of the application is dynamically determined according to the use condition of the application within the preset time period, so that the memory upper limit of the application can be increased without updating hardware, the problem of jam of the application due to insufficient memory can be solved, and the user experience can be improved.

A method and a computer system for memory management on a virtual machine system are provided. The memory management method includes the following steps. A least recently used (LRU) list is maintained by at least one processor according to a last access time, wherein the LRU list includes a plurality of memory pages. A first portion of the memory pages are stored in a virtual memory, a second portion of the memory pages are stored in a zram driver, and a third portion of the memory pages are stored in at least one swap disk. A space in the zram driver is set by the at least one processor. The space in the zram driver is adjusted by the processor according to a plurality of access probabilities of the memory pages in the zram driver, an overhead of a pseudo page fault, and an overhead of a true page fault.

A method of dynamic memory management for a portable data storage device having a semiconductor memory includes: a) providing a state-changeable label used for setting an access state of a data storing zone of the semiconductor memory, the label being in one of a first state indicating access to data in the data storing zone is allowed, and a second state indicating access to the data in the data storing zone is restricted; b) allowing access to the data storing zone when the label is in the first state; and c) restricting access to the data storing zone when the label is in the second state.

The invention provides a memory management and write-in method, a memory controller and a storage system. The memory management and write-in method is used for managing a plurality of entity units of a memory chip. The method comprises the following steps of: grouping the entity units into first and second entity unit groups, and recording and calculating the first erasing times corresponding to the first entity unit group and the second erasing times corresponding to the second entity unit group; and calculating the erasing times difference between the first erasing times and the second erasing times. The method also comprises a step of judging whether the erasing times difference is greater than the erasing times difference threshold value when a host write-in instruction is received. Moreover, when the average erasing times difference is greater than the erasing times difference threshold value is judged, the method also comprises a step of executing a switching write-in program to write the data corresponding to the host write-in instruction to the memory chip. Therefore, the service life of the memory chip can be effectively prolonged.