]> 2026-09-08T17:22:54+09:00 Lesson:a case for hardware based demand paging bdf187f5 3000 ko 향후 CPU/SSD co-design, demand-paged persistent/fast storage에 높고 기존 배포형 시스템에는 낮음. LBA-augmented page table로 I/O-stack 작업을 control plane으로 옮기고, Storage Management Unit이 대부분의 miss에서 CPU가 OS 개입 없이 I/O command를 직접 발행하게 한다. 자원 관리는 OS가 비동기적으로 처리한다. S3ResearchAgent medium Publication scope: international. Lab publication metadata: 1. Gyusun Lee*, Wenjing Jin*, Wonsuk Song, Jeonghun Gong, Jonghyun Bae, Tae Jun Ham, Jae W. Lee, and Jinkyu Jeong, "A Case for Hardware-based Demand Paging," in Proceedings of the 47th IEEE/ACM International Symposium on Computer Architecture (ISCA'20), Valencia, Spain, May 30-June 3, 2020. slides, video (* equally contributed) Verification level: official_abstract. Sources checked: https://yonsei.elsevierpure.com/en/publications/a-case-for-hardware-based-demand-paging/ https://doi.org/10.1109/ISCA45697.2020.00093 2026-07-16T15:04:36Z 2461238.1281944 Publication record 1: Gyusun Lee*, Wenjing Jin*, Wonsuk Song, Jeonghun Gong, Jonghyun Bae, Tae Jun Ham, Jae W. Lee, and Jinkyu Jeong, "A Case for Hardware-based Demand Paging," in Proceedings of the 47th IEEE/ACM International Symposium on Computer Architecture (ISCA'20), Valencia, Spain, May 30-June 3, 2020. slides, video (* equally contributed) 공개 원문을 확보하지 못해 hardware area/energy, protection·fault corner case와 OS fallback 경로를 검증하지 못했다. 평가는 simulator와 한 종류의 실제 x86/ultra-low-latency SSD 조합이므로 광범위한 CPU·SSD 일반화는 추가 검증이 필요하다. 새 page-table/SMU와 OS 변경이 필요한 architecture proposal이다. Technical interpretation: storage latency가 짧아지면 전통적으로 무시했던 page-fault software stack이 지배적이 되므로 자원관리 control plane과 miss I/O data path를 분리할 가치가 있다. A Case for Hardware-based Demand Paging cycle-level simulator와 ultra-low-latency SSD를 장착한 실제 x86 평가에서 demand-paging latency 37.0% 감소. FIO random-read 최대 57.1%, NoSQL server 최대 27.3% 성능 향상. OS 개입 감소의 부수 효과로 user-code IPC 최대 7.0% 증가. ultra-low-latency SSD 시대에 page fault latency의 큰 비중이 된 OS kernel I/O stack을 hardware/OS co-design으로 critical path에서 제거할 수 있는가? lab storage latency가 짧아지면 전통적으로 무시했던 page-fault software stack이 지배적이 되므로 자원관리 control plane과 miss I/O data path를 분리할 가치가 있다. Draft 2026-07-18T14:58:15Z 2461240.1237847 2026-07-18T14:58:15Z 2461240.1237847 a case for hardware based demand paging bdf187f5 3000 ev_d332b55d8f8b46e1 2026-07-16T15:04:37Z 2461238.128206 S3ResearchAgent Gyusun Lee*, Wenjing Jin*, Wonsuk Song, Jeonghun Gong, Jonghyun Bae, Tae Jun Ham, Jae W. Lee, and Jinkyu Jeong, "A Case for Hardware-based Demand Paging," in Proceedings of the 47th IEEE/ACM International Symposium on Computer Architecture (ISCA'20), Valencia, Spain, May 30-June 3, 2020. slides, video (* equally contributed) paper Source: Yonsei University Computer Systems Laboratory publication list supplied by the user. Manifestation 1 of 1. not_recorded a case for hardware based demand paging bdf187f5# 9c8a793ab3f224eab818ce7f3e6708e4 3000 canonical-paper-v2-bdf187f5 2026-07-18T05:10:28Z 2461239.7156019 S3ResearchAgent Gyusun Lee*, Wenjing Jin*, Wonsuk Song, Jeonghun Gong, Jonghyun Bae, Tae Jun Ham, Jae W. Lee, and Jinkyu Jeong, "A Case for Hardware-based Demand Paging" in Proceedings of the 47th IEEE/ACM International Symposium on Computer Architecture (ISCA'20), Valencia, Spain, May 30-June 3, 2020. (* equally contributed) paper 정본 Lesson 보강 근거. 검토 원본: Lesson:technical_review_a_case_for_hardware_based_demand_paging_163a61b2. 확인 범위: official_abstract. 확인한 자료: https://yonsei.elsevierpure.com/en/publications/a-case-for-hardware-based-demand-paging/ ; https://doi.org/10.1109/ISCA45697.2020.00093. 질문, 방법, 평가, 해석, 재사용 교훈, 적용 범위와 한계를 같은 Lesson 본문에 통합했습니다. official_abstract a case for hardware based demand paging bdf187f5# 432e609924950ff5072efcb289772731 3000 2026-07-18T14:57:43Z 2461240.1234144 S3ResearchAgent verify_14be20cabf5f566d9050 partial_source context 보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함. inconclusive e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c 보존 파일 objects/sha256/e3/e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c ev_d332b55d8f8b46e1 aa2440051ebc5db2e1dee96afca0b21caf09b234070b55e91eae6fedc5075c5b a case for hardware based demand paging bdf187f5# fd68691df587e774ccad0ef48eb696d9 3000 2026-07-18T14:58:15Z 2461240.1237847 S3ResearchAgent verify_b8899f0485499b39d626 partial_source context 보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함. inconclusive e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c 보존 파일 objects/sha256/e3/e33769dcc3e1485797b732d2ccf3f515148a040ed2067eb53791508ae0de808c canonical-paper-v2-bdf187f5 d3466c9f7bb33f1393d9e6d01a587b880684f4e09545b4886a9731c2a3ed6177 a case for hardware based demand paging bdf187f5# 2e03cc52b75bfa8627546233b700a272 Lesson:technical review a case for hardware based demand paging 163a61b2 3000 ko technical review a case for hardware based demand paging 163a61b2 Supersedes 102 ko Supersedes