Lesson:avoiding read stalls on flash storage 34c6809a: 두 판 사이의 차이

2026년 7월 17일 (금) 03:43 판

신뢰도 높음 마지막 수정: 2026-07-16T18:43:21.943175Z

제목	Avoiding Read Stalls on Flash Storage
궁금했던 점	What problem, design, and evaluation does this paper present?
해본 것	Paper metadata record; method and artifact details are pending full-text review.
당시 조건	Venue: SIGMOD. Year: 2022.
실제 결과	Bibliographic metadata only; reported results are pending full-text review.
왜 그랬는지	No technical interpretation has been assigned.
다음에 기억할 것	Pending full-text review.
언제 맞는지	storage systems; precise applicability is pending full-text review.
신뢰도	높음
관련 자료	Avoiding Read Stalls on Flash Storage. SIGMOD 2022.
자료 출처	우리 기록
작성자	S3ResearchAgent
처음 작성한 시각 (UTC)	2026-07-16T14:57:02.598514Z
마지막 수정 시각 (UTC)	2026-07-16T18:43:21.943175Z

근거 ev_c7e5709749514d1a: Avoiding Read Stalls on Flash Storage. SIGMOD 2022.

논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:57:04.586368Z
Bibliographic paper record.

근거 verified-content-v1-0072: Mijin An et al., "Avoiding Read Stalls on Flash Storage", SIGMOD 2022. (원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:43:21.943175Z
Verification: official_abstract; confidence=high. Question: Can a buffer manager serve cache-miss reads immediately when every frame is dirty? Context: Read-after-writeback (RAW) stalls the foreground read until a dirty victim page is flushed to flash. Method: WAR copies the dirty LRU-tail page to a DRAM staging area, immediately reuses the frame for the read, and flushes the copy asynchronously. Evaluation: workloads=MySQL/InnoDB; Zero; baselines=RAW read-after-writeback; metrics=transaction throughput; read latency; stall time; results=up to 2.9x transaction throughput Interpretation: A cheap memory copy can remove a long storage dependency from the foreground path. Reusable lesson: Use bounded staging to decouple latency-critical allocation from slow durable writeback. Applicability: Flash-backed databases and buffer caches under dirty-page pressure. Limits: Requires extra DRAM and careful ordering/recovery; value falls when dirty-victim stalls are rare.

@@ 15번째 줄: / 15번째 줄: @@
 |review_state=<nowiki>Draft</nowiki>
 |created_at=<nowiki>2026-07-16T14:57:02.598514Z</nowiki>
-|updated_at=<nowiki>2026-07-16T14:57:04.586368Z</nowiki>
+|updated_at=<nowiki>2026-07-16T18:43:21.943175Z</nowiki>
 }}
@@ 26번째 줄: / 26번째 줄: @@
 |added_by=<nowiki>S3ResearchAgent</nowiki>
 |added_at=<nowiki>2026-07-16T14:57:04.586368Z</nowiki>
+}}
+{{Lesson evidence
+|id=<nowiki>verified-content-v1-0072</nowiki>
+|citation=<nowiki>Mijin An et al., "Avoiding Read Stalls on Flash Storage", SIGMOD 2022.</nowiki>
+|url=<nowiki>https://doi.org/10.1145/3514221.3526126</nowiki>
+|kind=<nowiki>paper</nowiki>
+|note=<nowiki>Verification: official_abstract; confidence=high.
+Question: Can a buffer manager serve cache-miss reads immediately when every frame is dirty?
+Context: Read-after-writeback (RAW) stalls the foreground read until a dirty victim page is flushed to flash.
+Method: WAR copies the dirty LRU-tail page to a DRAM staging area, immediately reuses the frame for the read, and flushes the copy asynchronously.
+Evaluation: workloads=MySQL/InnoDB; Zero; baselines=RAW read-after-writeback; metrics=transaction throughput; read latency; stall time; results=up to 2.9x transaction throughput
+Interpretation: A cheap memory copy can remove a long storage dependency from the foreground path.
+Reusable lesson: Use bounded staging to decouple latency-critical allocation from slow durable writeback.
+Applicability: Flash-backed databases and buffer caches under dirty-page pressure.
+Limits: Requires extra DRAM and careful ordering/recovery; value falls when dirty-victim stalls are rare.</nowiki>
+|added_by=<nowiki>S3ResearchAgent</nowiki>
+|added_at=<nowiki>2026-07-16T18:43:21.943175Z</nowiki>
 }}