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

Disadvantages of pipeline - computer architecture, Disadvantages of pipelin...

Disadvantages of pipeline: Pipeline architecture has 2 major disadvantages.  First is its complexity and second is the inability to constantly run the pipeline at full speed,

State about agp, State about AGP The latest addition to many computer s...

State about AGP The latest addition to many computer systems is the inclusion of accelerated graphics port (AGP). AGP operates at the bus clock frequency of the microprocessor.

Difference between non-relocatable self relocatable programs, Differentiate...

Differentiate between non-relocatable self relocatable programs. A non-relocatable program is one which cannot be executed in any memory area other than the area starting at

De morgans laws, De Morgan's Laws : With continuing the relationship b...

De Morgan's Laws : With continuing the relationship between ^ and ? , we can also needs De Morgan's Law to rearrange sentences involving negation in conjunction with these con

Define the karnaugh maps (k maps), Define The Karnaugh Maps (K Maps) Th...

Define The Karnaugh Maps (K Maps) The Karnaugh map (K map) provides the systematic method for simplifying a Boolean expression or a truth table function when used properly the

Addressing mode, the 68000 has rich of addressing mode . it concerned with ...

the 68000 has rich of addressing mode . it concerned with the way data is accessed . identify the destion addressing mode for EXG D0, A2

What are the steps involved in authentication, What are the steps involved ...

What are the steps involved in authentication? Steps in Authentication The control over the access of the resources in the repository is exercised in two steps namely Auth

Explain the term confidentiality - firewall design policy, Explain the term...

Explain the term Confidentiality - Firewall Design Policy Whilst some corporate data is for public consumption, the vast majority of it should remain private.

Dynamic programing, a ship is loaded with a stock of 3 items each unit of i...

a ship is loaded with a stock of 3 items each unit of item n has a wt wn and vn the max cargo wt the ship can take is the details of 3items are item(n):1 2 3 wt(wn):2 3 1 value(vn)

Which 802 standard provides for a collision free protocol, Which 802 standa...

Which 802 standard provides for a collision free protocol? 802.5 standard gives for a collision free protocol.

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