Memory Administration (Additionally Dynamic Memory Management > 자유게시판

• 목록
• 답변
• 글쓰기
• 게시판 리스트 옵션
  • 수정
  • 삭제

Memory management (also dynamic memory administration, dynamic storage allocation, or dynamic memory allocation) is a type of resource management applied to laptop memory. The important requirement of memory administration is to offer ways to dynamically allocate portions of memory to programs at their request, and free it for reuse when not wanted. That is important to any advanced pc system the place more than a single process could be underway at any time. Several methods have been devised that increase the effectiveness of memory administration. Digital Memory Wave systems separate the Memory Wave Audio addresses utilized by a process from actual physical addresses, permitting separation of processes and rising the size of the digital handle house beyond the out there quantity of RAM utilizing paging or swapping to secondary storage. The quality of the virtual memory manager can have an intensive impact on general system performance. The system allows a computer to look as if it may have more memory available than bodily current, thereby permitting a number of processes to share it.

In different working techniques, e.g. Unix-like operating systems, memory is managed at the appliance degree. Memory management inside an address area is generally categorized as both handbook memory management or automated memory administration. The duty of fulfilling an allocation request consists of locating a block of unused memory of ample dimension. At any given time, some parts of the heap are in use, whereas some are "free" (unused) and thus accessible for future allocations. Within the C language, the operate which allocates memory from the heap is called malloc and the operate which takes beforehand allocated memory and marks it as "free" (to be used by future allocations) known as free. Several points complicate the implementation, similar to external fragmentation, which arises when there are a lot of small gaps between allocated memory blocks, which invalidates their use for an allocation request. The allocator's metadata may also inflate the scale of (individually) small allocations. This is usually managed by chunking. The memory management system should observe outstanding allocations to ensure that they do not overlap and that no memory is ever "misplaced" (i.e. that there are no "memory leaks").

The specific dynamic memory allocation algorithm implemented can influence performance considerably. A examine carried out in 1994 by Digital Equipment Corporation illustrates the overheads involved for a wide range of allocators. The bottom average instruction path length required to allocate a single memory slot was fifty two (as measured with an instruction stage profiler on quite a lot of software program). Since the exact location of the allocation is not identified in advance, the memory is accessed not directly, often by way of a pointer reference. Fastened-dimension blocks allocation, also known as memory pool allocation, uses a free list of fastened-measurement blocks of memory (often all of the identical measurement). This works well for simple embedded systems the place no large objects must be allocated however suffers from fragmentation especially with long memory addresses. Nonetheless, as a result of significantly lowered overhead, this methodology can considerably enhance efficiency for objects that want frequent allocation and deallocation, and so it is commonly used in video games. In this system, memory is allocated into several swimming pools of memory as an alternative of just one, where every pool represents blocks of memory of a sure energy of two in dimension, Memory Wave Audio or blocks of some other convenient size progression.

All blocks of a particular measurement are stored in a sorted linked checklist or tree and all new blocks that are formed throughout allocation are added to their respective memory pools for later use. If a smaller size is requested than is on the market, the smallest accessible measurement is selected and break up. One of many ensuing elements is chosen, and the method repeats till the request is complete. When a block is allocated, the allocator will start with the smallest sufficiently giant block to avoid needlessly breaking blocks. When a block is freed, it is in comparison with its buddy. If they are both free, they are mixed and positioned in the correspondingly bigger-sized buddy-block record. This Memory Wave allocation mechanism preallocates memory chunks suitable to suit objects of a certain type or size. These chunks are known as caches and the allocator only has to keep observe of a list of free cache slots.