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

What are conditional chain statement, What are conditional chain statement?...

What are conditional chain statement? ON CHAIN-INPUT similar to ON INPUT. The ABAP/4 module is called if any one of the fields in the chain having a value other than its in

Shape - elements of composition, Shape : A shape is any area that can b...

Shape : A shape is any area that can be perceived to have height and width. Shapes within an image can be created by the use of line, or by the edges created by variations in c

Differentiate between the serial port and parallel port, Question: (a) ...

Question: (a) Provide types of computer systems and briefly describe each one. (b) With the help of example, explain the difference between open source software, freeware a

What is event-driven control, What is event-driven control? Control res...

What is event-driven control? Control resides within a dispatcher or monitors that language, subsystem or OS provider. Developers attach application process to events and dispa

String, super string checker

super string checker

Recursion, Ask qurecurrion for short noteestion

Ask qurecurrion for short noteestion

Forward chaining, Forward Chaining: Now we have suppose we have a set ...

Forward Chaining: Now we have suppose we have a set of axioms that we know are true statements about the world. Whether we set these to each be an initial state of the segoal

In a for loop, In a for loop, if the condition is missing, then, It is s...

In a for loop, if the condition is missing, then, It is supposed to be present and taken to be true.

What is component diagrams in uml, A component diagram is mainly useful wit...

A component diagram is mainly useful with teams of larger size. UML components are great to perform architectural landscape for an exact system. The component diagram permits to mo

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