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 is the standard template library (stl), A library of container templat...

A library of container templates approved by the ANSI committee for inclusion in the standard C++ specification. A programmer who then launches into a discussion of the generic

Explain the recording mode for web vuser script, We use VuGen to make a Vus...

We use VuGen to make a Vuser script by recording a user performing typical business processes on a customer application. VuGen makes the script by recording the activity among the

Briefly explain the floating point representation, Briefly explain the floa...

Briefly explain the floating point representation with an example? The floating point representation has 3 fields 1.sign bit 2.siginificant bits 3.exponent For  exa

What is data hazard, What is data hazard? Any condition that causes the...

What is data hazard? Any condition that causes the pipeline to stall is known as a hazard. A data hazard is any condition in which either the source or destination operands of

Define deadlock with resource request and allocation graph, Define Deadlock...

Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All

Obstacles to is implementation - information system, Obstacles to IS implem...

Obstacles to IS implementation While information systems are now becoming the norm in most organisations the journey to this point has been a difficult one. Even in the 21st c

Define class p, Define class P  The class of all sets L that can be kno...

Define class P  The class of all sets L that can be known in polynomial time by deterministic TM. The class of all decision problems that can be decided in polynomial time.

Design a simple digital clock., Use a timer interrupt to design a easy digi...

Use a timer interrupt to design a easy digital clock.  This clock will count only minutes and seconds, and start at 00:00 every time your program starts.  The show on the screen sh

Write a .net web service program, Question: (a) Give three typical use...

Question: (a) Give three typical uses of Web Services. (b) Describe the term WebService Behavior and list its advantages. (c) Explain how Proxy classes are used to acc

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