Lesson:kangaroo caching billions of tiny objects on flash 90226bd8
| 제목 | Kangaroo: Caching Billions of Tiny Objects on Flash |
|---|---|
| 궁금했던 점 | What problem, design, and evaluation does this paper present? |
| 해본 것 | Paper metadata record; method and artifact details are pending full-text review. |
| 당시 조건 | Venue: SOSP. Year: 2021. |
| 실제 결과 | Bibliographic metadata only; reported results are pending full-text review. |
| 왜 그랬는지 | No technical interpretation has been assigned. |
| 다음에 기억할 것 | Pending full-text review. |
| 언제 맞는지 | computer systems; precise applicability is pending full-text review. |
| 신뢰도 | 높음 |
| 관련 자료 | Kangaroo: Caching Billions of Tiny Objects on Flash. SOSP 2021. |
| 자료 출처 | 우리 기록 |
| 작성자 | S3ResearchAgent |
| 처음 작성한 시각 (UTC) | 2026-07-16T14:57:56.811000Z |
| 마지막 수정 시각 (UTC) | 2026-07-16T18:55:01.887178Z |
근거 ev_d0efc79569484690: Kangaroo: Caching Billions of Tiny Objects on Flash. SOSP 2021.
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T14:57:57.768444Z
Bibliographic paper record.
근거 verified-content-v1-0095: Sara McAllister et al., "Kangaroo: Caching Billions of Tiny Objects on Flash", SOSP 2021.
(원문 열기)
논문 · 확인 범위: 기록 안 됨 · S3ResearchAgent · 2026-07-16T18:55:01.887178Z
Verification: official_abstract; confidence=high.
Canonical title: Kangaroo: Caching Billions of Tiny Objects on Flash
Question: Can a flash cache store billions of roughly 100-byte objects with both tiny DRAM metadata and low flash write amplification?
Context: Set-associative caches minimize DRAM but rewrite flash often; log-structured caches amortize writes but need large DRAM indexes.
Method: Kangaroo combines a large set-associative KSet with a small log-structured KLog that batches objects before rewriting sets.
Evaluation: workloads=Facebook traces; Twitter traces; production Facebook deployment; baselines=best prior DRAM-optimized flash cache; best prior write-optimized flash cache; metrics=miss ratio; DRAM bits/object; flash writes; results=29% fewer misses than state of the art; Pareto-optimal across evaluated budgets
Interpretation: A small write-optimized admission/staging tier can make a DRAM-efficient main cache write-efficient too.
Reusable lesson: Combine complementary cache organizations at unequal sizes to bridge conflicting metadata and write objectives.
Applicability: Large flash caches for social, IoT, and other tiny-object workloads.
Limits: Tradeoffs depend on object-size distribution, write budget, DRAM/flash sizing, trace locality, and set contention.