<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Garbage Collection on Hojoon Kim</title><link>https://hojoon.me/tags/garbage-collection/</link><description>Recent content in Garbage Collection on Hojoon Kim</description><generator>Hugo -- 0.146.0</generator><language>en</language><lastBuildDate>Tue, 13 Jun 2023 00:00:00 +0000</lastBuildDate><atom:link href="https://hojoon.me/tags/garbage-collection/index.xml" rel="self" type="application/rss+xml"/><item><title>[CS320] 7. 가비지 컬렉션</title><link>https://hojoon.me/posts/cs320/7-garbage-collection/</link><pubDate>Tue, 13 Jun 2023 00:00:00 +0000</pubDate><guid>https://hojoon.me/posts/cs320/7-garbage-collection/</guid><description>Reference Counting, Mark &amp;amp; Sweep, Two-Space Collection 세 가지 가비지 컬렉션 알고리즘의 원리와 장단점을 비교합니다.</description></item></channel></rss>