Explain garbage collection, Computer Engineering

Assignment Help:

Explain Garbage collection

In this method two passes are made over the memory to identify new areas. In the first pass it traverses all pointers pointing to allocated areas and marks the memory areas which are in use. The second pass finds out all unmarked areas and declares them to be free. The garbage collection overheads are not incremental. They are acquired every time the system runs out of free memory to allocate to new requests.  
Two major approaches to reuse free memory area in a heap are:

First-fit:  Allocate the first hole which is big enough. Searching can start either at the starting of the set of holes or where the previous first-fit search ended. Searching is stopped when a free hole is found that is large enough

Best-fit:  Allocate the smallest hole which is big enough; whole list is searched, unless ordered by size.  This strategy generates the smallest leftover hole.   


Related Discussions:- Explain garbage collection

Explain token ring, Explain Token Ring. Token Ring: A token ring is ...

Explain Token Ring. Token Ring: A token ring is a collection of single point -to-point links, which arise from a circle. In a token ring a special bi t pattern, termed as th

Explain criteria for choosing type of file organization, What criteria shou...

What criteria should be adopted for choosing type of file organization. Selecting a file organization is a design decision; therefore it must be done having in mind the achieve

Proof by contradiction, Proof by Contradiction: Now for forward chaini...

Proof by Contradiction: Now for forward chaining and backward chaining both have drawbacks. But another approach is to think about proving theorems by contradiction. So we can

Explain macro definition, Explain macro definition. A unit of specifica...

Explain macro definition. A unit of specification for a program generation is termed as a macro. This consists of name, body of code and set of formal parameters.

Minimize the logic function using NAND gate, Minimize the logic function F(...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates:  In

Evaluate sop expression, Q. For function F(x,y,z) = ∑m(0,1,2,6,7) using TRU...

Q. For function F(x,y,z) = ∑m(0,1,2,6,7) using TRUTH TABLE only.   1. Find SOP expression 2. Implement this simplified expression using two level AND-to-OR gate network 3. I

Compiler software difficulty, IA-64 instead depends on the compiler for thi...

IA-64 instead depends on the compiler for this task. Even before the program is fed into the CPU, the compiler studies the code and makes the similar sorts of decisions that would

Operation of micro-programmed control unit, Micro-instructions are stored i...

Micro-instructions are stored in control memory. Address register for control memory comprises the address of subsequent instruction which is to be read. Control memory Buffer Regi

Artificial intelligence, Artificial intelligence ( AL) is a field of scien...

Artificial intelligence ( AL) is a field of science and technology based on disciplines such as computer science biology psychology linguistics mathematics and engineering. The g

Write unix commands, For the following, cmd1 and cmd2 are arbitrary UNIX co...

For the following, cmd1 and cmd2 are arbitrary UNIX commands, and file1 and file2 are files owned by you. Write UNIX (bash) commands to: (a) Run cmd1 and append its output to f

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