Garbage collection: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| (One intermediate revision by the same user not shown) | |||
| Line 112: | Line 112: | ||
<h2>Contents <a href="javascript:void(0);" class="hide-link" onclick="toggleTOC()">[hide]</a></h2> | <h2>Contents <a href="javascript:void(0);" class="hide-link" onclick="toggleTOC()">[hide]</a></h2> | ||
<ul> | <ul> | ||
<li><a href="#section1"> Background information</a></li> | |||
<li><a href="#section1"> | |||
<li><a href="#section3"> Flow chart of order of operations</a></li> | <li><a href="#section3"> Flow chart of order of operations</a></li> | ||
<li><a href="#section5"> Related Topics</a></li> | <li><a href="#section5"> Related Topics</a></li> | ||
<li><a href="#section6"> Further reading</a></li> | <li><a href="#section6"> Further reading</a></li> | ||
| Line 127: | Line 119: | ||
</div> | </div> | ||
<!-- background information --> | <!-- background information --> | ||
<h1> Background information </h1> | <h1 id="section1"> Background information </h1> | ||
<p>Garbage collection(GC) algorithms are responsible for detecting useless data such files which are simply no longer needed such as marked for deleted or unused(stale pages)(link)</br> | <p>Garbage collection(GC) algorithms are responsible for detecting useless data such files which are simply no longer needed such as marked for deleted or unused(stale pages)(link)</br> | ||
Once the data stored within a block reaches a thread hold often defined by the GC algorithm, such as the block have a certain percentage of stale data or when the block is full.</br> | Once the data stored within a block reaches a thread hold often defined by the GC algorithm, such as the block have a certain percentage of stale data or when the block is full.</br> | ||
The GC moves all the valid data from the block to another clear block, then clears the remaining data ready for the block to be used again </p> | The GC moves all the valid data from the block to another clear block, then clears the remaining data ready for the block to be used again </p> | ||
<h1 id="section3">Flow chart of order of operations</h1> | <h1 id="section3">Flow chart of order of operations</h1> | ||
<p>Insert a flow chart of steps and actions for each task (create using diagram)</p> | <p>Insert a flow chart of steps and actions for each task (create using diagram)</p> | ||
<h1 id="section5">Related Topics</h1> | <h1 id="section5">Related Topics</h1> | ||
Latest revision as of 16:03, 15 January 2025
Background information
Garbage collection(GC) algorithms are responsible for detecting useless data such files which are simply no longer needed such as marked for deleted or unused(stale pages)(link)
Once the data stored within a block reaches a thread hold often defined by the GC algorithm, such as the block have a certain percentage of stale data or when the block is full.
The GC moves all the valid data from the block to another clear block, then clears the remaining data ready for the block to be used again
Flow chart of order of operations
Insert a flow chart of steps and actions for each task (create using diagram)
Related Topics
Topics such as desoldering to chip off or firmware dumping for disk PCB repairs
Further reading
External references in wiki references can just be cited through the keyword link
- Reference 1: Garbage Collection paper
- Reference 2: Source details