Question

How are allocated and unallocated segments structured in the heap?

Answer 1

Heap Management:

A very versatile storage allocation mechanism is heap allocation. Any variety of information objects is allotted and freed in an exceedingly memory pool, known as a heap. Heap allocation is staggeringly widespread. most non-trivial Java and C programs use new or malloc.

Heap Allocation:

A request for a heap house could also be specific or implicit. a particular request involves a decision to a routine like new or malloc. a particular pointer to the recently allotted house it came. Some languages permit the creation of information objects of unknown size. In Java, the '+' operator is full to represent string catenation.

The heap is an element of the method memory and it doesn't have a hard and fast size. Heap memory allocation is performed by the C library after you call malloc (calloc, realloc) and free.

First a fast review on method memory: A method may be a running instance of your program. every method has its own address. for instance on a 32-bit machine, your method gets regarding four billion addresses to play with, however, not all of those square measure valid or perhaps mapped to actual physical memory (RAM). within the process's memory, you'll realize the feasible code, house for the stack, surroundings variables, international (static) variables and also the heap.

Best Fit:
The free house list is sought for the free block that matches most closely the requested size. This minimizes wasted heap house, the search could also be quite slow.

First Fit:
The first free heap block of ample size is employed. Unused house at intervals the block is split off and joined as a smaller free house block. This approach is quick, however, it could “clutter” the start of the free house list with a variety of blocks too little to satisfy most requests.

Next Fit:
This is a variant of 1st slot in that succeeding searches of the free house list begin at the position wherever the last search complete. the concept is to “cycle through” the complete free house list instead of invariably revisiting free blocks at the pinnacle of the list.

Deallocation Mechanisms:
Allocating the heap house is fairly simply , If lots of object square measure allotted sometimes or square measure terribly lasting, deallocation is senseless. we have a tendency to merely fill heap house with “in use” objects. computer memory & paging could permit the apportion a really massive heap space. On a 64-bit machine, if we have a tendency to apportion heap area at 1 MB/sec. Fragmentation of a really massive heap house usually forces to incorporate some kind of application of heap space.

challenges of writing heap allocation:

The main challenges square measure is
1.Need to minimize fragmentation ( maximize memory utilization)
2.Need high performance
3.Fiddly implementation

What is calloc:
Unlike malloc, calloc initializes memory contents to zero and conjointly takes 2 arguments (the variety of things and also the size in bytes of every item). A naive however legible implementation of calloc. Programmers typically use calloc rather than expressly calling memset after malloc, to line the memory contents to zero. Note calloc(x,y) is identical to calloc(y,x).

what is realloc :
realloc allows you to size associate degree existing memory allocation that was antecedently allotted on the heap (via malloc,calloc or realloc). the foremost common use of realloc is to size memory wont to hold an associate degree array of values.

Thank U:)