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

Input output in assembly program, Q. Input output in assembly program? ...

Q. Input output in assembly program? Software interrupt is a call to an Interrupt servicing program situated in the operating system. Generally the input-output routine in 8086

Example of the horizon problem, Example of the horizon problem: It is ...

Example of the horizon problem: It is also worth bearing in mind the horizon problem, however a game-playing agent cannot see much far satisfactory into the search space. Now

Computer Architecture, can u please tell me the assembly language program f...

can u please tell me the assembly language program for carry look ahead adder that can run in 8086 emulator?? its urgent

Component fulfil this requirement, A component has the time to failure dist...

A component has the time to failure distribution that is modelled as the Weibull distribution with shape parameter 3 and scale parameter of 36 months. This component is planned to

Which is valid syntax of the fork and join primitive, Which is valid syntax...

Which is valid syntax of the Fork and Join Primitive? Ans. A valid syntax of the Fork and Join Primitive is as given below: Fork Join

The void type is used for, The void type is used for  The void type is ...

The void type is used for  The void type is used to make generic pointers.

What is electronic data interchange, What is Electronic Data Interchange? ...

What is Electronic Data Interchange? Electronic Data Interchange (EDI): It is used by organizations for transactions which arise on regular basis to a pre-found format.

How 2-domain name servers contain exactly same set of names, Does it makes ...

Does it makes sense for two domain name servers to contain exactly the same set of names? Why? Yes. This is very advantageous for two domain servers having similar set of names

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

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