Incremental garbage collection is an efficient way to improve the performance of real-time applications. It divides the full garbage collection process into smaller parts that each execute for a minimal time with very short pauses. The Mark and Sweep algorithm identifies reachable objects in the Mark phase and clears unreachable objects in the Sweep phase. Garbage collection techniques reduce the effort of manual memory management for programmers.

1. INCREMENTAL
GARBAGE COLLECTION
An efficient way to increase
the performance of real time
applications.

2.  What is Garbage Collection?
 Collecting unused objects in a program and
freeing the memory occupied by them is
known as garbage collection.
 What is incremental garbage collection?
 The Complete garbage collection execution
process is divided into several parts in such a
way that each part executes in a minimum
time with very short pauses to improve
performance.

3.  Mark and Sweep algorithm:
Like other garbage collection algorithms, Mark
and Sweep also performs garbage collection in
two stages.
In Mark phase, all the reachable objects are identified
through traversal of tree.
In Sweep phase, all the unreachable
objects in heap memory is cleared.

4. In built garbage collection technique reduced the effort of memory
management manually by the programmer.

5. SUMMARY
 Definition of garbage collection
 Definition of incremental garbage collection
 Algorithms to implement garbage collection.
 Phases in Mark and Sweep Algorithm
 How garbage collection made easy

6. Hey Friend,
This was just a summary on Incremental Garbage Collection.
For more detailed information on this topic, please type the
link given below or copy it from the description of this PPT and
open it in a new browser window.
www.transtutors.com/homework-help/computer-science/incremental-garbage-collection.aspx