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

Programming with parallel virtual machine, Q. Programming with parallel vir...

Q. Programming with parallel virtual machine? The general method for writing a program with PVM is like this:  A user writes one or more sequential programs in C++, C or FOR

In what way interrupts are classified in 8085, 8085 the interrupts are clas...

8085 the interrupts are classified as Software and Hardware interrupts.

Define the refresh rates and frame rate, Q. Define the Refresh Rates and fr...

Q. Define the Refresh Rates and frame rate? A special circuit known as the Video Controller scans video memory one row at a time and reads data value at each address sending th

Example on cyclic distribution of data, Q. Example on Cyclic Distribution o...

Q. Example on Cyclic Distribution of data? !HPF$ PROCESSORS P1(4) !HPF$ TEMPLATE T1(18) !HPF$ DISTRIBUTE T1(CYCLIC) ONTO P1 The result of these instructions is display

Information gain, Information Gain: Now next here instantly return to ...

Information Gain: Now next here instantly return to the problem of trying to determine the best attribute to choose for a particular node in a tree. As in the following measur

Logic gates required to build a half adder, What are the gates required to ...

What are the gates required to build a half adder ? Ans. The gates needed to build a half adder are EX-OR gate and AND gate as shown below the logic diagram of half adder:

Give an example, Write the HTML code for the following table: ...

Write the HTML code for the following table: T E M P E R A T U R E C I T I E S

Operating sustem, describe the action by thread library to context switch ...

describe the action by thread library to context switch between user level threads

Baic electrical, Ask question #Minimumstate and explain thevenins theorem a...

Ask question #Minimumstate and explain thevenins theorem as applicable to electrical circuits 100 words accepted#

Future of hyper threading, Current Pentium 4 based MPUs use Hyper-threading...

Current Pentium 4 based MPUs use Hyper-threading, but the next-generation cores, Woodcrest and Merom, Conroe will not. While some have alleged that this is because Hyper-threading

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