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

State the structure of verilog code you follow, State the structure of Veri...

State the structure of Verilog code you follow? A good template for your Verilog file is shown below. // timescale directive tells the simulator the base units and precision

Explain about barrier, Q. Explain about Barrier? Barrier: No actual tra...

Q. Explain about Barrier? Barrier: No actual transfer of data takes place in this mode unless all the processors involved in the communication execute a particular block, calle

Pc configuration and troubleshooting, You have been asked to become the con...

You have been asked to become the consulting technician for MobTex, a local auto servicing centre. The general manager (Jo) realises that the IT system has evolved over time with l

Factor causing parallel overheads, Performance metrics aren't able to attai...

Performance metrics aren't able to attain a linear curve in comparison to increase in number of processors in parallel computer. The main reason for above situation is presence of

How many i/p & o/p a full adder logic circuit will have, A full adder logic...

A full adder logic circuit will have ? Ans. The full adder logic circuit also accounts the carry i/p generated in the earlier stage and it will add two bits. Hence three inputs

State the relative addressing, State the Relative addressing The locati...

State the Relative addressing The location of data is specified relative to current value of the program counter. This is helpful for specifying location of data which is given

Computer science, Read in integers until a zero is read in. Keep a total o...

Read in integers until a zero is read in. Keep a total of both the quantity and the sum of the negative integers and the positive integers. Once a zero is read in (signifying the

How do you create a permanent cookie, How do you create a permanent cookie?...

How do you create a permanent cookie?  By setting the expiry date of the cookie to a later on time (like 10 years later.)

Real-time systems, This document is intended to help students get started w...

This document is intended to help students get started with the real-time systems (RTS) assignment. We will start on the assignment together in the laboratory. Students will then c

Shared-memory programming model, Q. Shared-memory programming model? In...

Q. Shared-memory programming model? In shared-memory programming model tasks share a common address space that they read and write asynchronously. Several mechanisms like semap

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