Identify free memory areas in allocation and de-allocations, Computer Engineering

Assignment Help:

Name and explain the popular techniques to identify free memory areas as a result of allocation and de-allocations in a heap.

Two well-liked techniques to identify free memory areas like a result of allocation and de-allocations in a heap are as:

1. Reference count: the system relates a reference count with each memory area to show the number of its active users. This number is incremented while a user accesses such area and decrements while user stops using it. The region is free if the reference counts drops to zero. Such scheme is very simple to implement although incurs incremental overheads.

2. Garbage collection: In such technique two passes are done over the memory to identify unused areas. Into the first pass this traverses all pointers pointing to assigned areas and marks the memory areas which are in use. The second pass determines all unmarked areas and declares them to be free. Its overheads are not incremental. They are incurred all time the system runs-out of free memory to assign to fresh requests.


Related Discussions:- Identify free memory areas in allocation and de-allocations

Internet application development, As an employee of an up and coming web De...

As an employee of an up and coming web Design Company, you have been approached by a small local cinema, called Valley Viewing who are looking to revamp their existing HTML website

What is interrupt vector table, Interrupt vector table is always created in...

Interrupt vector table is always created in first 1K area of the memory. Explain why? When CPU receives an interrupt type number from PIC, it uses this number to look up corres

Connector of conventional keyboard, 5-pin DIN connector: It is the conn...

5-pin DIN connector: It is the connector of conventional keyboard which have 5 pins (2 IN, 2 OUT and one ground pin) used for transfer and synchronization.

What are the minimal cost and minimal risksolution, In binary representatio...

In binary representation there are some states that are believed to be never occurred because of some particular functionality of a given circuit. If zero output is assigned to suc

What happens to logic after synthesis, What happens to logic after synthesi...

What happens to logic after synthesis, which is driving an unconnected output port that is left open (, that is, noconnect) during its module instantiation? An unconnected out

Minimum degree of t=1 for a b-tree, Why don't we permit a minimum degree of...

Why don't we permit a minimum degree of t=1 for a B-tree? According to the definition of B-Tree, a B-Tree of order n means that every node in the tree has a maximum of n-1 keys

Define security protocols used for e-commerce applications, Define various ...

Define various security protocols used for e-commerce applications. The e-commerce systems of today are composed of very many components as like: a commerce server, client soft

Direct or random access of elements, Direct or random access of elements is...

Direct or random access of elements is not possible in:- In Linked list direct or random access of elements is not possible

Difference between packet switching and circuit switching, What are the adv...

What are the advantages and disadvantages of packet switching over circuit switching? The comparison of packet switching and circuit switching demonstrating advantages and disa

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd