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

What are null values, What are null values? If the value of a field in ...

What are null values? If the value of a field in a table is indeterminate or unknown, it is known as a null value.

System software, what can be the good projects for system software subject

what can be the good projects for system software subject

Illustrate the term EDI trading patterns, Illustrate the term EDI Trading P...

Illustrate the term EDI Trading Patterns? EDI Trading Patterns are illustrated below: a. Hubs and Spokes: Several of the prime movers into the adoption of Electronic Da

Describe the vertical frequency or cycle, Q. Describe the Vertical Frequenc...

Q. Describe the Vertical Frequency or cycle? Like a Fluorescent lamp, the screen has to repeat same image many times per second to display an image to user. The frequency of th

Explain the odd-even transposition algorithm, Q. Explain the odd-even trans...

Q. Explain the odd-even transposition algorithm? The algorithm needs one 'for loop' beginning from I=1 to N it implies that N times and for every value of I, one 'for loop' of

Explain the stack in digital computers, Explain the stack in digital comput...

Explain the stack in digital computers The stack in digital computers is fundamentally a memory unit with an address register which can count only (after first value is loaded

Explain bottom-up parsing techniques, Explain Bottom-up Parsing Techniques ...

Explain Bottom-up Parsing Techniques A parser can begin with the input and attempt to rewrite it to the start symbol. Instinctively, the parser attempts to locate the most bas

Meaning of every field in mips instruction, Q. Meaning of every field in MI...

Q. Meaning of every field in MIPS instruction? The meaning of every field in MIPS instruction is given below: op: operation code or opcode rs: First register source

What is algorithm design technique, What is Algorithm Design Technique? ...

What is Algorithm Design Technique? An  algorithm  design  method  is  a  general  approach  to  solving  problems  algorithmically  that  is applicable to a variety of proble

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