{"id":40563,"date":"2026-05-16T09:01:27","date_gmt":"2026-05-16T00:01:27","guid":{"rendered":"https:\/\/blog.agentsoft.co.kr\/index.php\/2026\/05\/16\/40563\/"},"modified":"2026-05-16T09:01:27","modified_gmt":"2026-05-16T00:01:27","slug":"pintos-project-3-final-report-virtual-memory-frame-table","status":"publish","type":"post","link":"https:\/\/blog.agentsoft.co.kr\/index.php\/2026\/05\/16\/40563\/","title":{"rendered":"Pintos Project 3 final report – Virtual Memory, Frame table"},"content":{"rendered":"

<\/p>\n

\ubaa9\ucc28<\/strong><\/p>\n

1. frame table
\n1.1. Algorithm
\n1.2. Data Structure
\n1.3. Function<\/p>\n

2. lazy loading
\n2.1. Algorithm
\n2.2. Function<\/p>\n

3. Supplemental page table
\n3.1. Algorithm
\n3.2. Data Structure
\n3.3. Function<\/p>\n

4. stack growth
\n4.1. Algorithm
\n4.2. Function<\/p>\n

5. File memory mapping
\n5.1. Algorithm
\n5.2. Data structure
\n5.3. Function<\/p>\n

6. Swap table
\n6.1. Algorithm
\n6.2. Data structure
\n6.3.Function<\/p>\n

7. On process termination
\n7.1. Algorithm
\n7.2. Function<\/p>\n

8. discussion<\/p>\n

\ubcf8\ubb38\ub0b4\uc6a9<\/strong><\/p>\n

1. frame table
\n\uc5b4\ub5a4 page\uc5d0 frame\uc744 \ud560\ub2f9\ud558\uae30 \uc704\ud574 frame table\uc744 \uc21c\ud68c\ud558\uc600\uc744 \ub54c
\n1. free frame\uc774 \uc874\uc7ac\ud558\ub294 \uacbd\uc6b0
\n\ud574\ub2f9 frame\uc744 \ud560\ub2f9\ud558\uba74 \ub41c\ub2e4.
\n2. free frame\uc774 \uc874\uc7ac\ud558\uc9c0 \uc54a\ub294 \uacbd\uc6b0
\n\ub2e4\ub978 frame\uc758 page\ub97c evict\ud558\uc5ec \uc0c8\ub85c\uc6b4 free frame\uc744 \ub9cc\ub4e4\uc5b4\uc57c \ud55c\ub2e4
\n\uc774\ub54c page replacement algorithm\uc744 \ud1b5\ud574
\nevict\ud560 frame\uc744 \uace0\ub978 \ud6c4,
\n\ud604\uc7ac frame\uc5d0 \ucc38\uc870\uc911\uc778 \ubaa8\ub4e0 page table\uc758 reference\ub97c \uc81c\uac70\ud558\uace0,
\npage\uc5d0 \ubcc0\ud654\uac00 \uc788\ub2e4\uba74 write back\uc774\ub098 swap\uc744 \uc218\ud589\ud55c\ub2e4.
\nevict\ub41c frame\uc740 \uc0c8\ub85c\uc6b4 page\ub97c \uc800\uc7a5\ud558\uae30 \uc704\ud574 \uc0ac\uc6a9\ub41c\ub2e4.
\nproject 3\uc5d0\uc11c
\nframe\uc5d0\uc11c\uc758 eviction\uc744 \uc704\ud574 \uc0ac\uc6a9\ud560 page replacement algorithm\uc740 Clock algorithm\uc774\ub2e4.
\n\uc774 \uc54c\uace0\ub9ac\uc998\uc740
\nframe table\uc744 \uc21c\ud68c\ud558\uc5ec
\npage\uc758 accessed bit\uc774 1\uc778 \uacbd\uc6b0 0\uc73c\ub85c \ubc14\uafd4\uc8fc\uace0,
\npage\uc758 accessed bit\uc774 0\uc778 \uacbd\uc6b0 \uc774\ub97c \uc120\ud0dd\ud55c\ub2e4.
\n1.1. Algorithm
\nFrame \uc0dd\uc131
\nFrame \uc0dd\uc131\uc744 \uc704\ud55c memory\uacf5\uac04\uc744 \ud560\ub2f9\ud558\uae30 \uc704\ud574 frame_allocate\uc744 \ud638\ucd9c\ud55c\ub2e4.
\n\uc774\ub54c, palloc_get_page(PAL_USER) \ub97c \ud1b5\ud574 user pool\ub85c\ubd80\ud130 page\ub97c \uc0dd\uc131\ud55c\ub2e4.
\npage allocation \uc131\uacf5
\n\uc0dd\uc131\ud55c \uc8fc\uc18c \uadf8\ub300\ub85c \uc0ac\uc6a9
\npage allocation \uc2e4\ud328
\nfree frame\uc744 \ud655\ubcf4\ud558\uae30 \uc704\ud574 eviction()\uc744 \ud638\ucd9c\ud55c\ub2e4.
\npalloc_get_page()\ub97c \ub2e4\uc2dc \ud638\ucd9c\ud55c\ub2e4.
\nframe\uc744 \uc0dd\uc131\ud558\uae30 \uc704\ud574 malloc()\uc744 \ud638\ucd9c\ud55c\ub2e4.
\nframe\uc744 frame table\uc5d0 \ucd94\uac00\ud55c\ub2e4.
\nFrame \uc81c\uac70
\nFrame \uc81c\uac70\ub97c \uc704\ud55c frame_deallocate()\ub97c \ud638\ucd9c\ud55c\ub2e4.
\nFrame table\uc5d0\uc11c \ud574\ub2f9 frame\uc744 \ucc3e\uc73c\uba74,
\npage\ub97c \ud574\uc81c\ud574\uc8fc\uace0,
\nframe table\uc5d0\uc11c frame\uc744 \uc81c\uac70\ud55c\ub2e4.<\/p>\n

\ucd9c\ucc98 : \ud574\ud53c\ucea0\ud37c\uc2a4<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

\ubaa9\ucc28 1. frame table 1.1. Algorithm 1.2. Data Structure 1.3. Function 2. lazy loading 2.1. Algorithm 2.2. Function 3. Supplemental page table 3.1. Algorithm 3.2. Data Structure 3.3. Function 4. stack growth 4.1. Algorithm 4.2. Function 5. File memory mapping 5.1. Algorithm 5.2. Data structure 5.3. Function 6. Swap table 6.1. Algorithm 6.2. Data structure […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[12085,50878,50883,50880,50862,50882,50881,50879,16377,50863],"class_list":["post-40563","post","type-post","status-publish","format-standard","hentry","category-uncategorized","tag-acarbose","tag-frame-table","tag-lazy-loading","tag-page-table","tag-pintos","tag-stack-growth","tag-swap-table","tag-virtual-memory","tag-16377","tag-50863"],"_links":{"self":[{"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/posts\/40563","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/comments?post=40563"}],"version-history":[{"count":0,"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/posts\/40563\/revisions"}],"wp:attachment":[{"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/media?parent=40563"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/categories?post=40563"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.agentsoft.co.kr\/index.php\/wp-json\/wp\/v2\/tags?post=40563"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}