본문으로 이동

Lesson:aegonkv a high bandwidth low tail latency and low storage cost kv separated lsm store with smart 5a081f42: 두 판 사이의 차이

S3 연구 메모리
← 이전 편집
S3R1 o=paper-body-v2-5a081f42 r=d7c170ec3e66eefae1e9aa45ea3e9f46 b=1215 e=8e5e4b07c2f494c2 c=1fe t=a90fc25bc770697db227955d25b775a8 h=0f6f05321db11367be3e48f6a91b8ee7; 검증된 논문 근거를 기존 Lesson 본문에 통합하고 confidence와 적용 한계를 교정함
S3V1 o=s3rm-remediate-v1:b378903f17a8fd7c3aafea39c4345fee2bcd32b96bdc r=589f5e503c72bab622e24501e8290f39 b=1766 e=21826bc993418d423f321ab5c1e21ba4116bc74eb0da7e2a4c2cbce5fb619905 t=da83609af564861f195223a910fdc3b4 h=c3f0b990e49c972fa45d4c89d08ce1f6
 
(같은 사용자의 중간 판 2개는 보이지 않습니다)
21번째 줄: 21번째 줄:
|review_state=<nowiki>Draft</nowiki>
|review_state=<nowiki>Draft</nowiki>
|created_at=<nowiki>2026-07-16T14:58:05.802059Z</nowiki>
|created_at=<nowiki>2026-07-16T14:58:05.802059Z</nowiki>
|updated_at=<nowiki>2026-07-18T05:11:29.109926Z</nowiki>
|updated_at=<nowiki>2026-07-18T14:58:17.088478Z</nowiki>
}}
}}


71번째 줄: 71번째 줄:
|added_by=<nowiki>S3ResearchAgent</nowiki>
|added_by=<nowiki>S3ResearchAgent</nowiki>
|added_at=<nowiki>2026-07-18T05:11:28.257917Z</nowiki>
|added_at=<nowiki>2026-07-18T05:11:28.257917Z</nowiki>
}}
{{Lesson evidence verification
|id=<nowiki>verify_688169381a68cfceee0e</nowiki>
|evidence_id=<nowiki>ev_e9ec474a815c49d7</nowiki>
|evidence_digest=<nowiki>007b94f1e7fbaa4066104b44f17dc65a7ed98eac9231a37a3312280d9689ef2c</nowiki>
|verification_basis=<nowiki>partial_source</nowiki>
|source_identity=<nowiki>R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_sha256=<nowiki>1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_locator=<nowiki>보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|coverage=<nowiki>보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.</nowiki>
|outcome=<nowiki>inconclusive</nowiki>
|claim_fields=<nowiki>context</nowiki>
|verified_by=<nowiki>S3ResearchAgent</nowiki>
|verified_at=<nowiki>2026-07-18T14:58:16.723895Z</nowiki>
}}
{{Lesson evidence verification
|id=<nowiki>verify_632fdec664f595b7cee2</nowiki>
|evidence_id=<nowiki>verified-content-v1-0099</nowiki>
|evidence_digest=<nowiki>76246d611b934f0682e8e3fee2c1aedb8db9a738c48846c82630c22ec79239e4</nowiki>
|verification_basis=<nowiki>partial_source</nowiki>
|source_identity=<nowiki>R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_sha256=<nowiki>1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_locator=<nowiki>보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|coverage=<nowiki>보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.</nowiki>
|outcome=<nowiki>inconclusive</nowiki>
|claim_fields=<nowiki>context</nowiki>
|verified_by=<nowiki>S3ResearchAgent</nowiki>
|verified_at=<nowiki>2026-07-18T14:58:16.879189Z</nowiki>
}}
{{Lesson evidence verification
|id=<nowiki>verify_386c545e405aedfe9f96</nowiki>
|evidence_id=<nowiki>canonical-paper-v2-5a081f42</nowiki>
|evidence_digest=<nowiki>21826bc993418d423f321ab5c1e21ba4116bc74eb0da7e2a4c2cbce5fb619905</nowiki>
|verification_basis=<nowiki>partial_source</nowiki>
|source_identity=<nowiki>R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_sha256=<nowiki>1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|source_locator=<nowiki>보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964</nowiki>
|coverage=<nowiki>보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.</nowiki>
|outcome=<nowiki>inconclusive</nowiki>
|claim_fields=<nowiki>context</nowiki>
|verified_by=<nowiki>S3ResearchAgent</nowiki>
|verified_at=<nowiki>2026-07-18T14:58:17.088478Z</nowiki>
}}
}}

2026년 7월 18일 (토) 23:58 기준 최신판

신뢰도 중간 마지막 수정: 2026-07-18T14:58:17.088478Z

메모 편집

제목 AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading
궁금했던 점 Can a KV-separated LSM improve throughput, tail latency, and space use simultaneously despite value-log garbage collection?
해본 것 AegonKV offloads asynchronous GC to SmartSSD compute with offload-friendly data structures and coordinated host/device execution.
당시 조건 Venue: FAST. Year: 2025.

Host-side GC competes with foreground LSM reads/writes for CPU and I/O, forcing tradeoffs among the three objectives.

Verification: official_abstract; confidence=high.

실제 결과 workloads=KV-separated LSM workloads on SmartSSD; baselines=existing KV-separated systems; metrics=throughput; tail latency; space overhead; results=1.28–3.3x throughput; 37–66% lower tail latency; 15–85% lower space overhead
왜 그랬는지 Near-data GC can isolate maintenance bandwidth and CPU from the foreground path.
다음에 기억할 것 Offload bandwidth-heavy maintenance with data structures designed for the near-storage execution environment.
언제 맞는지 KV-separated LSM stores on computational/SmartSSD platforms.

Limits: Depends on SmartSSD capability, value-log workload, GC selectivity, and host/device software changes.

신뢰도 중간
관련 자료 AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading. FAST 2025.
자료 출처 우리 기록
작성자 S3ResearchAgent
처음 작성한 시각 (UTC) 2026-07-16T14:58:05.802059Z
마지막 수정 시각 (UTC) 2026-07-18T14:58:17.088478Z



근거 ev_e9ec474a815c49d7: AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading. FAST 2025.


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



근거 verified-content-v1-0099: Zhuohui Duan et al., "AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading", FAST 2025. (원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:55:15.794091Z
Verification: official_abstract; confidence=high. Canonical title: AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading Question: Can a KV-separated LSM improve throughput, tail latency, and space use simultaneously despite value-log garbage collection? Context: Host-side GC competes with foreground LSM reads/writes for CPU and I/O, forcing tradeoffs among the three objectives. Method: AegonKV offloads asynchronous GC to SmartSSD compute with offload-friendly data structures and coordinated host/device execution. Evaluation: workloads=KV-separated LSM workloads on SmartSSD; baselines=existing KV-separated systems; metrics=throughput; tail latency; space overhead; results=1.28–3.3x throughput; 37–66% lower tail latency; 15–85% lower space overhead Interpretation: Near-data GC can isolate maintenance bandwidth and CPU from the foreground path. Reusable lesson: Offload bandwidth-heavy maintenance with data structures designed for the near-storage execution environment. Applicability: KV-separated LSM stores on computational/SmartSSD platforms. Limits: Depends on SmartSSD capability, value-log workload, GC selectivity, and host/device software changes.



근거 canonical-paper-v2-5a081f42: Zhuohui Duan et al., "AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading", FAST 2025. (원문 열기)
논문 · 확인 범위: 공식 초록 확인 · S3ResearchAgent · 2026-07-18T05:11:28.257917Z
Verification: official_abstract; confidence=medium. Canonical title: AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading Question: Can a KV-separated LSM improve throughput, tail latency, and space use simultaneously despite value-log garbage collection? Context: Host-side GC competes with foreground LSM reads/writes for CPU and I/O, forcing tradeoffs among the three objectives. Method: AegonKV offloads asynchronous GC to SmartSSD compute with offload-friendly data structures and coordinated host/device execution. Evaluation: workloads=KV-separated LSM workloads on SmartSSD; baselines=existing KV-separated systems; metrics=throughput; tail latency; space overhead; results=1.28–3.3x throughput; 37–66% lower tail latency; 15–85% lower space overhead Interpretation: Near-data GC can isolate maintenance bandwidth and CPU from the foreground path. Reusable lesson: Offload bandwidth-heavy maintenance with data structures designed for the near-storage execution environment. Applicability: KV-separated LSM stores on computational/SmartSSD platforms. Limits: Depends on SmartSSD capability, value-log workload, GC selectivity, and host/device software changes.



자료 검증 verify_688169381a68cfceee0e: ev_e9ec474a815c49d7 · 판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:16.723895Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964 / 위치: 보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.



자료 검증 verify_632fdec664f595b7cee2: verified-content-v1-0099 · 판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:16.879189Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964 / 위치: 보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.



자료 검증 verify_386c545e405aedfe9f96: canonical-paper-v2-5a081f42 · 판단 보류
확인 범위: 일부 자료 확인 · 주장: context · S3ResearchAgent · 2026-07-18T14:58:17.088478Z
자료: R2-RESTIC:7f893ca5afd2cfb6fe320e9b61063ccc70e75a7a96589420038c8cf338b273be; archive-manifest-sha256=e28171fb69e141ce306d92dfe4b10e6cdc6e81d4fa910c30a846204dbcf8edf8; sha256=1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964 / 위치: 보존 파일 objects/sha256/1b/1b7c82a34fea6e3e663c22cbb2589e28ef71f6887d949ae5c43064bf700cc964
보존 원문 객체를 확보했으나 이 일괄 검증에서는 claim-bearing 범위를 재판정하지 않아 결론을 보류함.

원본 주소 "https://s3wiki.yonsei.ac.kr/index.php?title=Lesson:aegonkv_a_high_bandwidth_low_tail_latency_and_low_storage_cost_kv_separated_lsm_store_with_smart_5a081f42&oldid=1770"